TSTP Solution File: LCL903+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL903+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 : n014.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:17 EDT 2022
% Result : Theorem 0.48s 0.69s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL903+1 : TPTP v8.1.0. Released v5.5.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 04:11:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S
% 0.13/0.37 # and selection function SelectNewComplexAHP.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 15 Number of unprocessed: 15
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 15 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 8 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 7 extension rule candidate clauses
% 0.13/0.37 # 8 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.48/0.69 # There were 2 total branch saturation attempts.
% 0.48/0.69 # There were 0 of these attempts blocked.
% 0.48/0.69 # There were 0 deferred branch saturation attempts.
% 0.48/0.69 # There were 0 free duplicated saturations.
% 0.48/0.69 # There were 2 total successful branch saturations.
% 0.48/0.69 # There were 0 successful branch saturations in interreduction.
% 0.48/0.69 # There were 0 successful branch saturations on the branch.
% 0.48/0.69 # There were 2 successful branch saturations after the branch.
% 0.48/0.69 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.69 # Begin clausification derivation
% 0.48/0.69
% 0.48/0.69 # End clausification derivation
% 0.48/0.69 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.48/0.69 cnf(i_0_13, plain, ('+'(X1,'1')='1')).
% 0.48/0.69 cnf(i_0_9, plain, ('>='(X1,'0'))).
% 0.48/0.69 cnf(i_0_3, plain, ('+'(X1,'0')=X1)).
% 0.48/0.69 cnf(i_0_4, plain, ('>='(X1,X1))).
% 0.48/0.69 cnf(i_0_15, negated_conjecture, ('+'(esk1_0,esk1_0)!=esk1_0)).
% 0.48/0.69 cnf(i_0_2, plain, ('+'(X1,X2)='+'(X2,X1))).
% 0.48/0.69 cnf(i_0_6, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))).
% 0.48/0.69 cnf(i_0_5, plain, ('>='(X1,X3)|~'>='(X2,X3)|~'>='(X1,X2))).
% 0.48/0.69 cnf(i_0_1, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
% 0.48/0.69 cnf(i_0_14, plain, ('==>'('==>'('==>'(X1,'1'),X1),X1)='0')).
% 0.48/0.69 cnf(i_0_10, plain, ('>='('+'(X1,X3),'+'(X2,X3))|~'>='(X1,X2))).
% 0.48/0.69 cnf(i_0_12, plain, ('>='('==>'(X3,X1),'==>'(X3,X2))|~'>='(X1,X2))).
% 0.48/0.69 cnf(i_0_11, plain, ('>='('==>'(X2,X3),'==>'(X1,X3))|~'>='(X1,X2))).
% 0.48/0.69 cnf(i_0_8, plain, ('>='(X2,'==>'(X1,X3))|~'>='('+'(X1,X2),X3))).
% 0.48/0.69 cnf(i_0_7, plain, ('>='('+'(X2,X1),X3)|~'>='(X1,'==>'(X2,X3)))).
% 0.48/0.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.48/0.69 # Begin printing tableau
% 0.48/0.69 # Found 6 steps
% 0.48/0.69 cnf(i_0_15, negated_conjecture, ('+'(esk1_0,esk1_0)!=esk1_0), inference(start_rule)).
% 0.48/0.69 cnf(i_0_16, plain, ('+'(esk1_0,esk1_0)!=esk1_0), inference(extension_rule, [i_0_6])).
% 0.48/0.69 cnf(i_0_18, plain, (~'>='(esk1_0,'+'(esk1_0,esk1_0))), inference(extension_rule, [i_0_5])).
% 0.48/0.69 cnf(i_0_38, plain, (~'>='(esk1_0,'0')), inference(closure_rule, [i_0_9])).
% 0.48/0.69 cnf(i_0_19, plain, (~'>='('+'(esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_19, ...])).
% 0.48/0.69 cnf(i_0_37, plain, (~'>='('0','+'(esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_37, ...])).
% 0.48/0.69 # End printing tableau
% 0.48/0.69 # SZS output end
% 0.48/0.69 # Branches closed with saturation will be marked with an "s"
% 0.48/0.69 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.48/0.69 # We now have 1 tableaux to operate on
% 0.48/0.69 # Found closed tableau during pool population.
% 0.48/0.69 # Proof search is over...
% 0.48/0.69 # Freeing feature tree
%------------------------------------------------------------------------------