TSTP Solution File: LCL456+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 10:22:26 EDT 2022
% Result : Theorem 1.87s 0.64s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 19:15:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 82 Number of unprocessed: 58
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 58 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 44 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 14 extension rule candidate clauses
% 0.12/0.37 # 44 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 58 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 58 tableaux to operate on
% 1.87/0.64 # There were 2 total branch saturation attempts.
% 1.87/0.64 # There were 0 of these attempts blocked.
% 1.87/0.64 # There were 0 deferred branch saturation attempts.
% 1.87/0.64 # There were 0 free duplicated saturations.
% 1.87/0.64 # There were 2 total successful branch saturations.
% 1.87/0.64 # There were 1 successful branch saturations in interreduction.
% 1.87/0.64 # There were 0 successful branch saturations on the branch.
% 1.87/0.64 # There were 1 successful branch saturations after the branch.
% 1.87/0.64 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.87/0.64 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.87/0.64 # Begin clausification derivation
% 1.87/0.64
% 1.87/0.64 # End clausification derivation
% 1.87/0.64 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.87/0.64 cnf(i_0_64, plain, (modus_ponens)).
% 1.87/0.64 cnf(i_0_78, plain, (substitution_of_equivalents)).
% 1.87/0.64 cnf(i_0_65, plain, (modus_tollens)).
% 1.87/0.64 cnf(i_0_66, plain, (implies_1)).
% 1.87/0.64 cnf(i_0_67, plain, (implies_2)).
% 1.87/0.64 cnf(i_0_68, plain, (implies_3)).
% 1.87/0.64 cnf(i_0_69, plain, (and_1)).
% 1.87/0.64 cnf(i_0_70, plain, (and_2)).
% 1.87/0.64 cnf(i_0_71, plain, (and_3)).
% 1.87/0.64 cnf(i_0_72, plain, (or_1)).
% 1.87/0.64 cnf(i_0_73, plain, (or_2)).
% 1.87/0.64 cnf(i_0_74, plain, (or_3)).
% 1.87/0.64 cnf(i_0_75, plain, (equivalence_1)).
% 1.87/0.64 cnf(i_0_76, plain, (equivalence_2)).
% 1.87/0.64 cnf(i_0_77, plain, (equivalence_3)).
% 1.87/0.64 cnf(i_0_61, plain, (op_or)).
% 1.87/0.64 cnf(i_0_80, plain, (op_and)).
% 1.87/0.64 cnf(i_0_62, plain, (op_implies_and)).
% 1.87/0.64 cnf(i_0_79, plain, (op_implies_or)).
% 1.87/0.64 cnf(i_0_63, plain, (op_equiv)).
% 1.87/0.64 cnf(i_0_59, plain, (or(not(X1),X2)=implies(X1,X2))).
% 1.87/0.64 cnf(i_0_58, plain, (not(and(X1,not(X2)))=implies(X1,X2))).
% 1.87/0.64 cnf(i_0_11, plain, (is_a_theorem(implies(X1,implies(X2,X1))))).
% 1.87/0.64 cnf(i_0_25, plain, (is_a_theorem(implies(X1,or(X2,X1))))).
% 1.87/0.64 cnf(i_0_48, plain, (r2)).
% 1.87/0.64 cnf(i_0_23, plain, (is_a_theorem(implies(X1,or(X1,X2))))).
% 1.87/0.64 cnf(i_0_19, plain, (is_a_theorem(implies(and(X1,X2),X2)))).
% 1.87/0.64 cnf(i_0_17, plain, (is_a_theorem(implies(and(X1,X2),X1)))).
% 1.87/0.64 cnf(i_0_36, plain, (kn2)).
% 1.87/0.64 cnf(i_0_57, plain, (not(implies(X1,not(X2)))=and(X1,X2))).
% 1.87/0.64 cnf(i_0_56, plain, (implies(not(X1),X2)=or(X1,X2))).
% 1.87/0.64 cnf(i_0_31, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))))).
% 1.87/0.64 cnf(i_0_29, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))))).
% 1.87/0.64 cnf(i_0_21, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))).
% 1.87/0.64 cnf(i_0_42, plain, (cn2)).
% 1.87/0.64 cnf(i_0_60, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))).
% 1.87/0.64 cnf(i_0_9, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))))).
% 1.87/0.64 cnf(i_0_13, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))).
% 1.87/0.64 cnf(i_0_15, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))).
% 1.87/0.64 cnf(i_0_40, plain, (cn1)).
% 1.87/0.64 cnf(i_0_33, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))))).
% 1.87/0.64 cnf(i_0_27, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2)))))).
% 1.87/0.64 cnf(i_0_82, negated_conjecture, (~r3)).
% 1.87/0.64 cnf(i_0_50, plain, (~is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))))).
% 1.87/0.64 cnf(i_0_7, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))).
% 1.87/0.64 cnf(i_0_34, plain, (kn1|~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))))).
% 1.87/0.64 cnf(i_0_46, plain, (r1|~is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)))).
% 1.87/0.64 cnf(i_0_4, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
% 1.87/0.64 cnf(i_0_35, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)).
% 1.87/0.64 cnf(i_0_47, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)).
% 1.87/0.64 cnf(i_0_44, plain, (cn3|~is_a_theorem(implies(or(esk44_0,esk44_0),esk44_0)))).
% 1.87/0.64 cnf(i_0_45, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)).
% 1.87/0.64 cnf(i_0_54, plain, (r5|~is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))))).
% 1.87/0.64 cnf(i_0_52, plain, (r4|~is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0)))))).
% 1.87/0.64 cnf(i_0_38, plain, (kn3|~is_a_theorem(implies(implies(esk36_0,esk37_0),or(and(esk37_0,esk38_0),not(and(esk38_0,esk36_0))))))).
% 1.87/0.64 cnf(i_0_55, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)).
% 1.87/0.64 cnf(i_0_53, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)).
% 1.87/0.64 cnf(i_0_39, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)).
% 1.87/0.64 cnf(i_0_113, plain, (X127=X127)).
% 1.87/0.64 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.87/0.64 # Begin printing tableau
% 1.87/0.64 # Found 8 steps
% 1.87/0.64 cnf(i_0_4, plain, (is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))|~is_a_theorem(implies(or(esk49_0,esk48_0),implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))))|~is_a_theorem(or(esk49_0,esk48_0))), inference(start_rule)).
% 1.87/0.64 cnf(i_0_173, plain, (is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))), inference(closure_rule, [i_0_50])).
% 1.87/0.64 cnf(i_0_174, plain, (~is_a_theorem(implies(or(esk49_0,esk48_0),implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))))), inference(extension_rule, [i_0_4])).
% 1.87/0.64 cnf(i_0_363, plain, (~is_a_theorem(implies(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)),implies(or(esk49_0,esk48_0),implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))))), inference(closure_rule, [i_0_11])).
% 1.87/0.64 cnf(i_0_364, plain, (~is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))), inference(extension_rule, [i_0_117])).
% 1.87/0.64 cnf(i_0_399, plain, (or(not(or(esk48_0,esk49_0)),or(esk49_0,esk48_0))!=implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))), inference(closure_rule, [i_0_59])).
% 1.87/0.64 cnf(i_0_175, plain, (~is_a_theorem(or(esk49_0,esk48_0))), inference(etableau_closure_rule, [i_0_175, ...])).
% 1.87/0.64 cnf(i_0_400, plain, (~is_a_theorem(or(not(or(esk48_0,esk49_0)),or(esk49_0,esk48_0)))), inference(etableau_closure_rule, [i_0_400, ...])).
% 1.87/0.64 # End printing tableau
% 1.87/0.64 # SZS output end
% 1.87/0.64 # Branches closed with saturation will be marked with an "s"
% 1.87/0.65 # Child (26775) has found a proof.
% 1.87/0.65
% 1.87/0.65 # Proof search is over...
% 1.87/0.65 # Freeing feature tree
%------------------------------------------------------------------------------