TSTP Solution File: NUM852+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM852+2 : 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 : n007.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:11 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM852+2 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 5 21:09:28 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 21 Number of unprocessed: 20
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 20 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 1 conjectures.
% 0.20/0.39 # There are 1 start rule candidates:
% 0.20/0.39 # Found 11 unit axioms.
% 0.20/0.39 # 1 start rule tableaux created.
% 0.20/0.39 # 9 extension rule candidate clauses
% 0.20/0.39 # 11 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.40 # There were 2 total branch saturation attempts.
% 0.20/0.40 # There were 0 of these attempts blocked.
% 0.20/0.40 # There were 0 deferred branch saturation attempts.
% 0.20/0.40 # There were 0 free duplicated saturations.
% 0.20/0.40 # There were 2 total successful branch saturations.
% 0.20/0.40 # There were 0 successful branch saturations in interreduction.
% 0.20/0.40 # There were 0 successful branch saturations on the branch.
% 0.20/0.40 # There were 2 successful branch saturations after the branch.
% 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40 # Begin clausification derivation
% 0.20/0.40
% 0.20/0.40 # End clausification derivation
% 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40 cnf(i_0_2, plain, (greater(vd481,vd480))).
% 0.20/0.40 cnf(i_0_3, plain, (less(vd480,vd481))).
% 0.20/0.40 cnf(i_0_21, plain, (greater(vplus(X1,X2),X1))).
% 0.20/0.40 cnf(i_0_9, plain, (vmul(vmul(X1,X2),X3)=vmul(X1,vmul(X2,X3)))).
% 0.20/0.40 cnf(i_0_19, plain, (less(X1,vplus(X1,X2)))).
% 0.20/0.40 cnf(i_0_10, plain, (vplus(vmul(X1,X2),vmul(X1,X3))=vmul(X1,vplus(X2,X3)))).
% 0.20/0.40 cnf(i_0_11, plain, (vmul(X1,X2)=vmul(X2,X1))).
% 0.20/0.40 cnf(i_0_12, plain, (vmul(vsucc(X1),X2)=vplus(vmul(X1,X2),X2))).
% 0.20/0.40 cnf(i_0_18, plain, (~greater(X1,X1))).
% 0.20/0.40 cnf(i_0_16, plain, (~less(X1,X1))).
% 0.20/0.40 cnf(i_0_1, negated_conjecture, (~greater(vmul(vd469,vd481),vmul(vd469,vd480)))).
% 0.20/0.40 cnf(i_0_17, plain, (~less(X1,X2)|~greater(X1,X2))).
% 0.20/0.40 cnf(i_0_13, plain, (greater(X1,X2)|~less(X2,X1))).
% 0.20/0.40 cnf(i_0_14, plain, (less(X1,X2)|~greater(X2,X1))).
% 0.20/0.40 cnf(i_0_15, plain, (X1=X2|less(X1,X2)|greater(X1,X2))).
% 0.20/0.40 cnf(i_0_20, plain, (vplus(X1,esk1_2(X2,X1))=X2|~less(X1,X2))).
% 0.20/0.40 cnf(i_0_8, plain, (vplus(X1,vskolem9(X2,X1))=X2|~greater(X2,X1))).
% 0.20/0.40 cnf(i_0_22, plain, (vplus(X1,esk2_2(X1,X2))=X2|~greater(X2,X1))).
% 0.20/0.40 cnf(i_0_7, plain, (vmul(vd469,vplus(X1,vskolem9(X2,X1)))=vmul(X2,vd469)|~greater(X2,X1))).
% 0.20/0.40 cnf(i_0_6, plain, (vplus(vmul(X1,vd469),vmul(vd469,vskolem9(X2,X1)))=vmul(vd469,vplus(X1,vskolem9(X2,X1)))|~greater(X2,X1))).
% 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.40 # Begin printing tableau
% 0.20/0.40 # Found 5 steps
% 0.20/0.40 cnf(i_0_1, negated_conjecture, (~greater(vmul(vd469,vd481),vmul(vd469,vd480))), inference(start_rule)).
% 0.20/0.40 cnf(i_0_27, plain, (~greater(vmul(vd469,vd481),vmul(vd469,vd480))), inference(extension_rule, [i_0_15])).
% 0.20/0.40 cnf(i_0_35, plain, (less(vmul(vd469,vd481),vmul(vd469,vd480))), inference(extension_rule, [i_0_13])).
% 0.20/0.40 cnf(i_0_34, plain, (vmul(vd469,vd480)=vmul(vd469,vd481)), inference(etableau_closure_rule, [i_0_34, ...])).
% 0.20/0.40 cnf(i_0_68, plain, (greater(vmul(vd469,vd480),vmul(vd469,vd481))), inference(etableau_closure_rule, [i_0_68, ...])).
% 0.20/0.40 # End printing tableau
% 0.20/0.40 # SZS output end
% 0.20/0.40 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.40 # We now have 2 tableaux to operate on
% 0.20/0.40 # Found closed tableau during pool population.
% 0.20/0.40 # Proof search is over...
% 0.20/0.40 # Freeing feature tree
%------------------------------------------------------------------------------