TSTP Solution File: LCL900+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL900+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 : n023.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:16 EDT 2022
% Result : Theorem 266.80s 49.40s
% Output : CNFRefutation 266.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL900+1 : TPTP v8.1.0. Released v5.5.0.
% 0.10/0.11 % 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 : n023.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 : Mon Jul 4 15:23:12 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.35 # No SInE strategy applied
% 0.17/0.35 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.17/0.35 # and selection function SelectNewComplexAHP.
% 0.17/0.35 #
% 0.17/0.35 # Number of axioms: 15 Number of unprocessed: 15
% 0.17/0.35 # Tableaux proof search.
% 0.17/0.35 # APR header successfully linked.
% 0.17/0.35 # Hello from C++
% 1.21/1.44 # The folding up rule is enabled...
% 1.21/1.44 # Local unification is enabled...
% 1.21/1.44 # Any saturation attempts will use folding labels...
% 1.21/1.44 # 15 beginning clauses after preprocessing and clausification
% 1.21/1.44 # Creating start rules for all 1 conjectures.
% 1.21/1.44 # There are 1 start rule candidates:
% 1.21/1.44 # Found 8 unit axioms.
% 1.21/1.44 # 1 start rule tableaux created.
% 1.21/1.44 # 7 extension rule candidate clauses
% 1.21/1.44 # 8 unit axiom clauses
% 1.21/1.44
% 1.21/1.44 # Requested 8, 32 cores available to the main process.
% 1.21/1.44 # There are not enough tableaux to fork, creating more from the initial 1
% 17.93/18.16 # Creating equality axioms
% 17.93/18.16 # Ran out of tableaux, making start rules for all clauses
% 17.93/18.16 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
% 17.93/18.16 # We now have 23 tableaux to operate on
% 266.80/49.40 # There were 47 total branch saturation attempts.
% 266.80/49.40 # There were 16 of these attempts blocked.
% 266.80/49.40 # There were 0 deferred branch saturation attempts.
% 266.80/49.40 # There were 0 free duplicated saturations.
% 266.80/49.40 # There were 1 total successful branch saturations.
% 266.80/49.40 # There were 0 successful branch saturations in interreduction.
% 266.80/49.40 # There were 0 successful branch saturations on the branch.
% 266.80/49.40 # There were 1 successful branch saturations after the branch.
% 266.80/49.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 266.80/49.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 266.80/49.40 # Begin clausification derivation
% 266.80/49.40
% 266.80/49.40 # End clausification derivation
% 266.80/49.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 266.80/49.40 cnf(i_0_13, plain, ('+'(X1,'1')='1')).
% 266.80/49.40 cnf(i_0_9, plain, ('>='(X1,'0'))).
% 266.80/49.40 cnf(i_0_3, plain, ('+'(X1,'0')=X1)).
% 266.80/49.40 cnf(i_0_4, plain, ('>='(X1,X1))).
% 266.80/49.40 cnf(i_0_2, plain, ('+'(X1,X2)='+'(X2,X1))).
% 266.80/49.40 cnf(i_0_6, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))).
% 266.80/49.40 cnf(i_0_5, plain, ('>='(X1,X3)|~'>='(X2,X3)|~'>='(X1,X2))).
% 266.80/49.40 cnf(i_0_1, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
% 266.80/49.40 cnf(i_0_14, plain, ('==>'('==>'(X1,X2),X2)='==>'('==>'(X2,X1),X1))).
% 266.80/49.40 cnf(i_0_10, plain, ('>='('+'(X1,X3),'+'(X2,X3))|~'>='(X1,X2))).
% 266.80/49.40 cnf(i_0_12, plain, ('>='('==>'(X3,X1),'==>'(X3,X2))|~'>='(X1,X2))).
% 266.80/49.40 cnf(i_0_11, plain, ('>='('==>'(X2,X3),'==>'(X1,X3))|~'>='(X1,X2))).
% 266.80/49.40 cnf(i_0_15, negated_conjecture, ('+'(esk1_0,'==>'(esk1_0,esk2_0))!='+'(esk2_0,'==>'(esk2_0,esk1_0)))).
% 266.80/49.40 cnf(i_0_8, plain, ('>='(X2,'==>'(X1,X3))|~'>='('+'(X1,X2),X3))).
% 266.80/49.40 cnf(i_0_7, plain, ('>='('+'(X2,X1),X3)|~'>='(X1,'==>'(X2,X3)))).
% 266.80/49.40 cnf(i_0_3578849, plain, (X53=X53)).
% 266.80/49.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 266.80/49.40 # Begin printing tableau
% 266.80/49.40 # Found 9 steps
% 266.80/49.40 cnf(i_0_13, plain, ('+'(X6,'1')='1'), inference(start_rule)).
% 266.80/49.40 cnf(i_0_3578856, plain, ('+'(X6,'1')='1'), inference(extension_rule, [i_0_3578855])).
% 266.80/49.40 cnf(i_0_3578913, plain, ('+'('==>'('+'(X6,'1'),'0'),'1')!='1'), inference(closure_rule, [i_0_13])).
% 266.80/49.40 cnf(i_0_3578911, plain, ('==>'('+'(X6,'1'),'+'('==>'('+'(X6,'1'),'0'),'1'))='==>'('1','1')), inference(extension_rule, [i_0_3578854])).
% 266.80/49.40 cnf(i_0_6657622, plain, (~'>='('==>'('+'(X6,'1'),'+'('==>'('+'(X6,'1'),'0'),'1')),'==>'('+'(X6,'1'),'0'))), inference(extension_rule, [i_0_12])).
% 266.80/49.40 cnf(i_0_6657621, plain, ('+'('==>'('+'(X6,'1'),'0'),'0')!='==>'('+'(X6,'1'),'0')), inference(closure_rule, [i_0_3])).
% 266.80/49.40 cnf(i_0_6657725, plain, (~'>='('+'('==>'('+'(X6,'1'),'0'),'1'),'0')), inference(closure_rule, [i_0_9])).
% 266.80/49.40 cnf(i_0_6657619, plain, ('>='('==>'('1','1'),'+'('==>'('+'(X6,'1'),'0'),'0'))), inference(extension_rule, [i_0_12])).
% 266.80/49.40 cnf(i_0_7709788, plain, ('>='('==>'(X7,'==>'('1','1')),'==>'(X7,'+'('==>'('+'(X6,'1'),'0'),'0')))), inference(etableau_closure_rule, [i_0_7709788, ...])).
% 266.80/49.40 # End printing tableau
% 266.80/49.40 # SZS output end
% 266.80/49.40 # Branches closed with saturation will be marked with an "s"
% 266.80/49.42 # Child (6721) has found a proof.
% 266.80/49.42
% 266.80/49.42 # Proof search is over...
% 266.80/49.42 # Freeing feature tree
%------------------------------------------------------------------------------