TSTP Solution File: NUM842+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM842+1 : TPTP v8.1.0. Released v4.1.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 : Mon Jul 18 09:46:03 EDT 2022
% Result : Theorem 0.10s 0.31s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : NUM842+1 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.06/0.25 % Computer : n006.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Tue Jul 5 03:44:07 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.06/0.27 # No SInE strategy applied
% 0.06/0.27 # Auto-Mode selected heuristic G_E___208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.06/0.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.06/0.27 #
% 0.06/0.27 # Presaturation interreduction done
% 0.06/0.27 # Number of axioms: 50 Number of unprocessed: 42
% 0.06/0.27 # Tableaux proof search.
% 0.06/0.27 # APR header successfully linked.
% 0.06/0.27 # Hello from C++
% 0.06/0.27 # The folding up rule is enabled...
% 0.06/0.27 # Local unification is enabled...
% 0.06/0.27 # Any saturation attempts will use folding labels...
% 0.06/0.27 # 42 beginning clauses after preprocessing and clausification
% 0.06/0.27 # Creating start rules for all 1 conjectures.
% 0.06/0.27 # There are 1 start rule candidates:
% 0.06/0.27 # Found 13 unit axioms.
% 0.06/0.27 # 1 start rule tableaux created.
% 0.06/0.27 # 29 extension rule candidate clauses
% 0.06/0.27 # 13 unit axiom clauses
% 0.06/0.27
% 0.06/0.27 # Requested 8, 32 cores available to the main process.
% 0.06/0.27 # There are not enough tableaux to fork, creating more from the initial 1
% 0.10/0.31 # There were 2 total branch saturation attempts.
% 0.10/0.31 # There were 0 of these attempts blocked.
% 0.10/0.31 # There were 0 deferred branch saturation attempts.
% 0.10/0.31 # There were 0 free duplicated saturations.
% 0.10/0.31 # There were 2 total successful branch saturations.
% 0.10/0.31 # There were 0 successful branch saturations in interreduction.
% 0.10/0.31 # There were 0 successful branch saturations on the branch.
% 0.10/0.31 # There were 2 successful branch saturations after the branch.
% 0.10/0.31 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.31 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.31 # Begin clausification derivation
% 0.10/0.31
% 0.10/0.31 # End clausification derivation
% 0.10/0.31 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.10/0.31 cnf(i_0_23, plain, (geq(X1,X1))).
% 0.10/0.31 cnf(i_0_20, plain, (leq(X1,X1))).
% 0.10/0.31 cnf(i_0_13, plain, (greater(vplus(X1,X2),X1))).
% 0.10/0.31 cnf(i_0_32, plain, (less(X1,vplus(X1,X2)))).
% 0.10/0.31 cnf(i_0_45, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
% 0.10/0.31 cnf(i_0_42, plain, (vplus(X1,X2)=vplus(X2,X1))).
% 0.10/0.31 cnf(i_0_1, negated_conjecture, (~greater(vplus(vd353,vd355),vplus(vd354,vd356)))).
% 0.10/0.31 cnf(i_0_52, plain, (vplus(X1,v1)!=v1)).
% 0.10/0.31 cnf(i_0_41, plain, (vplus(X1,X2)!=X2)).
% 0.10/0.31 cnf(i_0_49, plain, (vplus(X1,v1)!=X1)).
% 0.10/0.31 cnf(i_0_31, plain, (~greater(X1,X1))).
% 0.10/0.31 cnf(i_0_29, plain, (~less(X1,X1))).
% 0.10/0.31 cnf(i_0_37, plain, (vplus(X1,X2)!=X1)).
% 0.10/0.31 cnf(i_0_4, plain, (greater(vd355,vd356)|greater(vd353,vd354))).
% 0.10/0.31 cnf(i_0_2, plain, (geq(vd353,vd354)|greater(vd353,vd354))).
% 0.10/0.31 cnf(i_0_5, plain, (geq(vd355,vd356)|greater(vd355,vd356))).
% 0.10/0.31 cnf(i_0_3, plain, (geq(vd355,vd356)|geq(vd353,vd354))).
% 0.10/0.31 cnf(i_0_30, plain, (~less(X1,X2)|~greater(X1,X2))).
% 0.10/0.31 cnf(i_0_26, plain, (greater(X1,X2)|~less(X2,X1))).
% 0.10/0.31 cnf(i_0_24, plain, (geq(X1,X2)|~greater(X1,X2))).
% 0.10/0.31 cnf(i_0_27, plain, (less(X1,X2)|~greater(X2,X1))).
% 0.10/0.31 cnf(i_0_19, plain, (leq(X1,X2)|~geq(X2,X1))).
% 0.10/0.31 cnf(i_0_18, plain, (geq(X1,X2)|~leq(X2,X1))).
% 0.10/0.31 cnf(i_0_21, plain, (leq(X1,X2)|~less(X1,X2))).
% 0.10/0.31 cnf(i_0_8, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))).
% 0.10/0.31 cnf(i_0_40, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))).
% 0.10/0.31 cnf(i_0_48, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)).
% 0.10/0.31 cnf(i_0_28, plain, (X1=X2|less(X1,X2)|greater(X1,X2))).
% 0.10/0.31 cnf(i_0_25, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))).
% 0.10/0.31 cnf(i_0_22, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))).
% 0.10/0.31 cnf(i_0_9, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))).
% 0.10/0.31 cnf(i_0_12, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))).
% 0.10/0.31 cnf(i_0_17, plain, (less(X1,X2)|~less(X1,X3)|~less(X3,X2))).
% 0.10/0.31 cnf(i_0_35, plain, (vplus(X1,esk2_2(X1,X2))=X2|~greater(X2,X1))).
% 0.10/0.31 cnf(i_0_7, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))).
% 0.10/0.31 cnf(i_0_15, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))).
% 0.10/0.31 cnf(i_0_16, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))).
% 0.10/0.31 cnf(i_0_14, plain, (leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2))).
% 0.10/0.31 cnf(i_0_33, plain, (vplus(X1,esk1_2(X2,X1))=X2|~less(X1,X2))).
% 0.10/0.31 cnf(i_0_6, plain, (greater(vplus(X1,X2),vplus(X3,X4))|~greater(X1,X3)|~greater(X2,X4))).
% 0.10/0.31 cnf(i_0_10, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))).
% 0.10/0.31 cnf(i_0_36, plain, (vplus(X1,esk3_2(X2,X1))=X2|vplus(X2,esk4_2(X2,X1))=X1|X2=X1)).
% 0.10/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.10/0.31 # Begin printing tableau
% 0.10/0.31 # Found 5 steps
% 0.10/0.31 cnf(i_0_1, negated_conjecture, (~greater(vplus(vd353,vd355),vplus(vd354,vd356))), inference(start_rule)).
% 0.10/0.31 cnf(i_0_62, plain, (~greater(vplus(vd353,vd355),vplus(vd354,vd356))), inference(extension_rule, [i_0_6])).
% 0.10/0.31 cnf(i_0_123, plain, (~greater(vd353,vd354)), inference(extension_rule, [i_0_2])).
% 0.10/0.31 cnf(i_0_124, plain, (~greater(vd355,vd356)), inference(etableau_closure_rule, [i_0_124, ...])).
% 0.10/0.31 cnf(i_0_132, plain, (geq(vd353,vd354)), inference(etableau_closure_rule, [i_0_132, ...])).
% 0.10/0.31 # End printing tableau
% 0.10/0.31 # SZS output end
% 0.10/0.31 # Branches closed with saturation will be marked with an "s"
% 0.10/0.31 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.10/0.31 # We now have 5 tableaux to operate on
% 0.10/0.31 # Found closed tableau during pool population.
% 0.10/0.31 # Proof search is over...
% 0.10/0.31 # Freeing feature tree
%------------------------------------------------------------------------------