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