TSTP Solution File: NUM849+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM849+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 : n020.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:09 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM849+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 22:22:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 13 Number of unprocessed: 10
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 10 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 2 conjectures.
% 0.12/0.36 # There are 2 start rule candidates:
% 0.12/0.36 # Found 9 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 2 start rule tableaux created.
% 0.12/0.36 # 1 extension rule candidate clauses
% 0.12/0.36 # 9 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 15 tableaux to operate on
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_11, plain, (vmul(X1,v1)=X1)).
% 0.12/0.37 cnf(i_0_2, negated_conjecture, (vmul(vd448,vmul(esk1_0,vd449))=vmul(esk1_0,vmul(vd449,vd448)))).
% 0.12/0.37 cnf(i_0_8, plain, (vplus(vmul(X1,X2),vmul(X1,X3))=vmul(X1,vplus(X2,X3)))).
% 0.12/0.37 cnf(i_0_9, plain, (vmul(X1,X2)=vmul(X2,X1))).
% 0.12/0.37 cnf(i_0_13, plain, (vplus(X1,X2)=vplus(X2,X1))).
% 0.12/0.37 cnf(i_0_15, plain, (vplus(v1,vplus(X1,X2))=vplus(X1,vplus(X2,v1)))).
% 0.12/0.37 cnf(i_0_12, plain, (vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2)))).
% 0.12/0.37 cnf(i_0_10, plain, (vmul(vplus(X1,v1),X2)=vplus(X2,vmul(X1,X2)))).
% 0.12/0.37 cnf(i_0_1, negated_conjecture, (vmul(vplus(esk1_0,v1),vmul(vd449,vd448))!=vmul(vd448,vmul(vd449,vplus(esk1_0,v1))))).
% 0.12/0.37 cnf(i_0_4, plain, (vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,X1)))=vmul(vd448,vmul(vd449,vplus(X1,v1)))|vmul(vmul(vd449,vd448),X1)!=vmul(vd448,vmul(vd449,X1)))).
% 0.12/0.37 cnf(i_0_22, plain, (X34=X34)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_8, plain, (vplus(vmul(X7,X2),vmul(X7,X3))=vmul(X7,vplus(X2,X3))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_30, plain, (vplus(vmul(X7,X2),vmul(X7,X3))=vmul(X7,vplus(X2,X3))), inference(extension_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_63, plain, (vplus(vmul(X7,X2),vmul(X7,X3))!=vmul(X7,vplus(X2,X3))), inference(closure_rule, [i_0_8])).
% 0.12/0.37 cnf(i_0_61, plain, (vplus(vmul(X7,X2),vmul(X7,X3))=vplus(vmul(X7,X2),vmul(X7,X3))), inference(extension_rule, [i_0_26])).
% 0.12/0.37 cnf(i_0_72, plain, (vmul(X7,v1)!=X7), inference(closure_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_70, plain, (vmul(vplus(vmul(X7,X2),vmul(X7,X3)),vmul(X7,v1))=vmul(vplus(vmul(X7,X2),vmul(X7,X3)),X7)), inference(etableau_closure_rule, [i_0_70, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (2998) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------