TSTP Solution File: LCL654+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL654+1.001 : TPTP v8.1.0. Released v4.0.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 : n020.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:23:52 EDT 2022
% Result : Theorem 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL654+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 06:22:00 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_S04AN
% 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: 15 Number of unprocessed: 15
% 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 # 15 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 14 conjectures.
% 0.12/0.37 # There are 14 start rule candidates:
% 0.12/0.37 # Found 5 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 14 start rule tableaux created.
% 0.12/0.37 # 10 extension rule candidate clauses
% 0.12/0.37 # 5 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.42 # There were 5 total branch saturation attempts.
% 0.12/0.42 # There were 0 of these attempts blocked.
% 0.12/0.42 # There were 0 deferred branch saturation attempts.
% 0.12/0.42 # There were 0 free duplicated saturations.
% 0.12/0.42 # There were 5 total successful branch saturations.
% 0.12/0.42 # There were 0 successful branch saturations in interreduction.
% 0.12/0.42 # There were 0 successful branch saturations on the branch.
% 0.12/0.42 # There were 5 successful branch saturations after the branch.
% 0.12/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.42 # Begin clausification derivation
% 0.12/0.42
% 0.12/0.42 # End clausification derivation
% 0.12/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.42 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.12/0.42 cnf(i_0_5, negated_conjecture, (r1(esk7_0,esk8_0))).
% 0.12/0.42 cnf(i_0_4, negated_conjecture, (r1(esk8_0,esk9_0))).
% 0.12/0.42 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.12/0.42 cnf(i_0_3, negated_conjecture, (~p1(esk9_0))).
% 0.12/0.42 cnf(i_0_2, negated_conjecture, (p1(X1)|~r1(esk7_0,X1))).
% 0.12/0.42 cnf(i_0_7, negated_conjecture, (r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.42 cnf(i_0_14, negated_conjecture, (p1(esk2_2(X1,X2))|~p1(X1)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.42 cnf(i_0_15, negated_conjecture, (r1(X1,esk2_2(X2,X1))|~p1(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.42 cnf(i_0_8, negated_conjecture, (p1(X1)|~p1(esk5_2(X2,X3))|~r1(esk4_2(X2,X4),X1)|~r1(esk1_0,X2)|~r1(X2,X4)|~r1(X2,X3))).
% 0.12/0.42 cnf(i_0_12, negated_conjecture, (p1(X1)|~p1(esk3_3(X2,X3,X4))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X3,X4)|~r1(X2,X3))).
% 0.12/0.42 cnf(i_0_10, negated_conjecture, (r1(X1,esk4_2(X2,X1))|~p1(esk5_2(X2,X3))|~r1(esk1_0,X2)|~r1(X2,X1)|~r1(X2,X3))).
% 0.12/0.42 cnf(i_0_9, negated_conjecture, (p1(X1)|r1(X2,esk5_2(X3,X2))|~r1(esk4_2(X3,X4),X1)|~r1(esk1_0,X3)|~r1(X3,X4)|~r1(X3,X2))).
% 0.12/0.42 cnf(i_0_11, negated_conjecture, (r1(X1,esk5_2(X2,X1))|r1(X3,esk4_2(X2,X3))|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X2,X1))).
% 0.12/0.42 cnf(i_0_13, negated_conjecture, (p1(X1)|r1(X2,esk3_3(X3,X4,X2))|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))).
% 0.12/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.42 # Begin printing tableau
% 0.12/0.42 # Found 13 steps
% 0.12/0.42 cnf(i_0_14, negated_conjecture, (p1(esk2_2(esk1_0,esk1_0))|~p1(esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.12/0.42 cnf(i_0_56, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.42 cnf(i_0_57, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.42 cnf(i_0_54, plain, (p1(esk2_2(esk1_0,esk1_0))), inference(extension_rule, [i_0_15])).
% 0.12/0.42 cnf(i_0_103, plain, (~r1(esk2_2(esk1_0,esk1_0),esk2_2(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 0.12/0.42 cnf(i_0_100, plain, (r1(esk2_2(esk1_0,esk1_0),esk2_2(esk2_2(esk1_0,esk1_0),esk2_2(esk1_0,esk1_0)))), inference(extension_rule, [i_0_13])).
% 0.12/0.42 cnf(i_0_106, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.42 cnf(i_0_108, plain, (~r1(esk2_2(esk1_0,esk1_0),esk2_2(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 0.12/0.42 cnf(i_0_55, plain, (~p1(esk1_0)), inference(etableau_closure_rule, [i_0_55, ...])).
% 0.12/0.42 cnf(i_0_102, plain, (~r1(esk1_0,esk2_2(esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_102, ...])).
% 0.12/0.42 cnf(i_0_104, plain, (p1(esk2_2(esk2_2(esk1_0,esk1_0),esk2_2(esk1_0,esk1_0)))), inference(etableau_closure_rule, [i_0_104, ...])).
% 0.12/0.42 cnf(i_0_105, plain, (r1(esk2_2(esk1_0,esk1_0),esk3_3(esk1_0,esk2_2(esk1_0,esk1_0),esk2_2(esk1_0,esk1_0)))), inference(etableau_closure_rule, [i_0_105, ...])).
% 0.12/0.42 cnf(i_0_109, plain, (~r1(esk1_0,esk2_2(esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_109, ...])).
% 0.12/0.42 # End printing tableau
% 0.12/0.42 # SZS output end
% 0.12/0.42 # Branches closed with saturation will be marked with an "s"
% 0.12/0.42 # Child (19946) has found a proof.
% 0.12/0.42
% 0.12/0.42 # Proof search is over...
% 0.12/0.42 # Freeing feature tree
%------------------------------------------------------------------------------