TSTP Solution File: NUM835+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM835+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 : n027.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:45:58 EDT 2022
% Result : Theorem 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM835+1 : TPTP v8.1.0. Released v4.1.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.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jul 6 10:09:43 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.18/0.36 # and selection function SelectCQIPrecW.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 39 Number of unprocessed: 15
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 15 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 3 conjectures.
% 0.18/0.36 # There are 3 start rule candidates:
% 0.18/0.36 # Found 10 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 3 start rule tableaux created.
% 0.18/0.36 # 5 extension rule candidate clauses
% 0.18/0.36 # 10 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.36 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.18/0.36 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.18/0.36 # There were 0 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 0 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 0 successful branch saturations after the branch.
% 0.18/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_29, plain, (m(X1))).
% 0.18/0.36 cnf(i_0_43, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
% 0.18/0.36 cnf(i_0_40, plain, (vplus(X1,X2)=vplus(X2,X1))).
% 0.18/0.36 cnf(i_0_1, negated_conjecture, (vd151!=vd165)).
% 0.18/0.36 cnf(i_0_3, negated_conjecture, (vplus(vd151,X1)!=vd165)).
% 0.18/0.36 cnf(i_0_2, negated_conjecture, (vplus(vd165,X1)!=vd151)).
% 0.18/0.36 cnf(i_0_50, plain, (vplus(X1,v1)!=v1)).
% 0.18/0.36 cnf(i_0_39, plain, (vplus(X1,X2)!=X2)).
% 0.18/0.36 cnf(i_0_47, plain, (vplus(X1,v1)!=X1)).
% 0.18/0.36 cnf(i_0_31, plain, (vplus(X1,X2)!=X1)).
% 0.18/0.36 cnf(i_0_48, plain, (X1=X2|vplus(X1,v1)!=vplus(X2,v1))).
% 0.18/0.36 cnf(i_0_38, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))).
% 0.18/0.36 cnf(i_0_46, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)).
% 0.18/0.36 cnf(i_0_21, plain, (vplus(v1,esk1_1(v1))=vd151|vd151=v1)).
% 0.18/0.36 cnf(i_0_30, plain, (vplus(X1,esk3_2(X1,X2))=X2|vplus(X2,esk2_2(X1,X2))=X1|X2=X1)).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 4 steps
% 0.18/0.36 cnf(i_0_2, negated_conjecture, (vplus(vd165,esk2_2(vd151,vd165))!=vd151), inference(start_rule)).
% 0.18/0.36 cnf(i_0_60, plain, (vplus(vd165,esk2_2(vd151,vd165))!=vd151), inference(extension_rule, [i_0_30])).
% 0.18/0.36 cnf(i_0_71, plain, (vplus(vd151,esk3_2(vd151,vd165))=vd165), inference(closure_rule, [i_0_3])).
% 0.18/0.36 cnf(i_0_73, plain, (vd165=vd151), inference(closure_rule, [i_0_1])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 7 tableaux to operate on
% 0.18/0.36 # Found closed tableau during pool population.
% 0.18/0.36 # Proof search is over...
% 0.18/0.36 # Freeing feature tree
%------------------------------------------------------------------------------