TSTP Solution File: LCL894+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL894+1 : TPTP v8.1.0. Released v5.5.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 : n006.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:26:13 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL894+1 : TPTP v8.1.0. Released v5.5.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.12/0.33 % Computer : n006.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 : Mon Jul 4 08:51:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 16 Number of unprocessed: 16
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # 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 # 16 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 3 conjectures.
% 0.12/0.37 # There are 3 start rule candidates:
% 0.12/0.37 # Found 6 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 3 start rule tableaux created.
% 0.12/0.37 # 10 extension rule candidate clauses
% 0.12/0.37 # 6 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 3
% 0.12/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 16 tableaux to operate on
% 0.19/0.48 # Creating equality axioms
% 0.19/0.48 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.48 # There were 1 total branch saturation attempts.
% 0.19/0.48 # There were 0 of these attempts blocked.
% 0.19/0.48 # There were 0 deferred branch saturation attempts.
% 0.19/0.48 # There were 0 free duplicated saturations.
% 0.19/0.48 # There were 1 total successful branch saturations.
% 0.19/0.48 # There were 0 successful branch saturations in interreduction.
% 0.19/0.48 # There were 0 successful branch saturations on the branch.
% 0.19/0.48 # There were 1 successful branch saturations after the branch.
% 0.19/0.48 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 # Begin clausification derivation
% 0.19/0.48
% 0.19/0.48 # End clausification derivation
% 0.19/0.48 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.48 cnf(i_0_9, plain, ('>='(X1,'0'))).
% 0.19/0.48 cnf(i_0_4, plain, ('>='(X1,X1))).
% 0.19/0.48 cnf(i_0_3, plain, ('+'(X1,'0')=X1)).
% 0.19/0.48 cnf(i_0_1, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
% 0.19/0.48 cnf(i_0_2, plain, ('+'(X1,X2)='+'(X2,X1))).
% 0.19/0.48 cnf(i_0_13, plain, ('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1)))).
% 0.19/0.48 cnf(i_0_16, negated_conjecture, (~'>='(c,'+'(a,'==>'(a,b)))|~'>='(c,a)|~'>='(c,b))).
% 0.19/0.48 cnf(i_0_15, negated_conjecture, ('>='(c,'+'(a,'==>'(a,b)))|'>='(c,a))).
% 0.19/0.48 cnf(i_0_14, negated_conjecture, ('>='(c,'+'(a,'==>'(a,b)))|'>='(c,b))).
% 0.19/0.48 cnf(i_0_6, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))).
% 0.19/0.48 cnf(i_0_5, plain, ('>='(X1,X2)|~'>='(X3,X2)|~'>='(X1,X3))).
% 0.19/0.48 cnf(i_0_7, plain, ('>='('+'(X1,X2),X3)|~'>='(X2,'==>'(X1,X3)))).
% 0.19/0.48 cnf(i_0_8, plain, ('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3))).
% 0.19/0.48 cnf(i_0_10, plain, ('>='('+'(X1,X2),'+'(X3,X2))|~'>='(X1,X3))).
% 0.19/0.48 cnf(i_0_12, plain, ('>='('==>'(X1,X2),'==>'(X1,X3))|~'>='(X2,X3))).
% 0.19/0.48 cnf(i_0_11, plain, ('>='('==>'(X1,X2),'==>'(X3,X2))|~'>='(X3,X1))).
% 0.19/0.48 cnf(i_0_116, plain, (X48=X48)).
% 0.19/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.48 # Begin printing tableau
% 0.19/0.48 # Found 6 steps
% 0.19/0.48 cnf(i_0_116, plain, (X5=X5), inference(start_rule)).
% 0.19/0.48 cnf(i_0_152, plain, (X5=X5), inference(extension_rule, [i_0_120])).
% 0.19/0.48 cnf(i_0_185, plain, ('+'('0','0')!='0'), inference(closure_rule, [i_0_3])).
% 0.19/0.48 cnf(i_0_183, plain, ('+'(X5,'+'('0','0'))='+'(X5,'0')), inference(extension_rule, [i_0_119])).
% 0.19/0.48 cnf(i_0_215, plain, ('+'(X5,'0')!=X5), inference(closure_rule, [i_0_3])).
% 0.19/0.48 cnf(i_0_213, plain, ('+'(X5,'+'('0','0'))=X5), inference(etableau_closure_rule, [i_0_213, ...])).
% 0.19/0.48 # End printing tableau
% 0.19/0.48 # SZS output end
% 0.19/0.48 # Branches closed with saturation will be marked with an "s"
% 0.19/0.49 # Child (26687) has found a proof.
% 0.19/0.49
% 0.19/0.49 # Proof search is over...
% 0.19/0.49 # Freeing feature tree
%------------------------------------------------------------------------------