TSTP Solution File: NUM420-1.000 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM420-1.000 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 09:40:49 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM420-1.000 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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 : n014.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 15:09:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.12/0.36 # and selection function SelectNewComplexAHPNS.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 56 Number of unprocessed: 39
% 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 # 39 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 14 conjectures.
% 0.12/0.36 # There are 14 start rule candidates:
% 0.12/0.36 # Found 23 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 14 start rule tableaux created.
% 0.12/0.36 # 16 extension rule candidate clauses
% 0.12/0.36 # 23 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 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 Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_108, plain, (times(X1,n1)=X1)).
% 0.12/0.37 cnf(i_0_93, plain, (plus(X1,n0)=X1)).
% 0.12/0.37 cnf(i_0_111, plain, (times(n1,X1)=X1)).
% 0.12/0.37 cnf(i_0_99, plain, (plus(n0,X1)=X1)).
% 0.12/0.37 cnf(i_0_121, plain, (less(n0,plus(X1,n1)))).
% 0.12/0.37 cnf(i_0_109, plain, (times(times(X1,X2),X3)=times(X1,times(X2,X3)))).
% 0.12/0.37 cnf(i_0_96, plain, (plus(plus(X1,X2),X3)=plus(X1,plus(X2,X3)))).
% 0.12/0.37 cnf(i_0_112, plain, (plus(times(X1,X2),times(X1,X3))=times(X1,plus(X2,X3)))).
% 0.12/0.37 cnf(i_0_117, plain, (plus(times(X1,X2),times(X3,X2))=times(plus(X3,X1),X2))).
% 0.12/0.37 cnf(i_0_169, negated_conjecture, (less(n1,p__0))).
% 0.12/0.37 cnf(i_0_159, negated_conjecture, (less(n0,p__0))).
% 0.12/0.37 cnf(i_0_143, negated_conjecture, (plus(n1,s_7(p__0))=p__0)).
% 0.12/0.37 cnf(i_0_157, negated_conjecture, (less(s_5(p__0,X1),p__0))).
% 0.12/0.37 cnf(i_0_147, negated_conjecture, (plus(s_5(p__0,X1),times(p__0,s_6(p__0,X1)))=X1)).
% 0.12/0.37 cnf(i_0_106, plain, (times(X1,X2)=times(X2,X1))).
% 0.12/0.37 cnf(i_0_97, plain, (plus(X1,X2)=plus(X2,X1))).
% 0.12/0.37 cnf(i_0_116, plain, (plus(X1,times(X1,X2))=times(X1,plus(X2,n1)))).
% 0.12/0.37 cnf(i_0_127, negated_conjecture, (plus(X1,plus(times(X2,plus(X3,plus(n1,n1))),plus(n1,times(X3,plus(X1,n1)))))=plus(X2,times(plus(X2,plus(X1,n1)),plus(X3,n1))))).
% 0.12/0.37 cnf(i_0_107, plain, (plus(X1,n1)!=n0)).
% 0.12/0.37 cnf(i_0_134, negated_conjecture, (~element(X1,X2))).
% 0.12/0.37 cnf(i_0_105, plain, (plus(n1,plus(X1,n1))!=n1)).
% 0.12/0.37 cnf(i_0_122, plain, (~less(n1,n1))).
% 0.12/0.37 cnf(i_0_179, negated_conjecture, (times(X1,p__0)!=n1)).
% 0.12/0.37 cnf(i_0_178, negated_conjecture, (s_1(X1)=p__0|X1=n1)).
% 0.12/0.37 cnf(i_0_124, plain, (times(X1,X2)!=n1|~less(n1,X2))).
% 0.12/0.37 cnf(i_0_119, plain, (X1=n1|times(X2,X1)!=n1)).
% 0.12/0.37 cnf(i_0_118, plain, (X1=n1|times(X1,X2)!=n1)).
% 0.12/0.37 cnf(i_0_92, plain, (plus(X1,times(X2,X3))!=plus(X4,times(X5,X3))|~less(X4,X3)|~less(X1,X3)|~less(X1,X4))).
% 0.12/0.37 cnf(i_0_100, plain, (X1=n0|plus(X1,X2)!=X2)).
% 0.12/0.37 cnf(i_0_101, plain, (X1=n0|plus(X2,X1)!=X2)).
% 0.12/0.37 cnf(i_0_173, negated_conjecture, (times(s_1(X1),s_4(X1))=X1|X1=n1)).
% 0.12/0.37 cnf(i_0_98, plain, (X1=X2|plus(X3,X1)!=plus(X3,X2))).
% 0.12/0.37 cnf(i_0_94, plain, (X1=X2|plus(X1,X3)!=plus(X2,X3))).
% 0.12/0.37 cnf(i_0_125, plain, (less(X1,X2)|~less(plus(X1,n1),X2))).
% 0.12/0.37 cnf(i_0_123, plain, (X1=X2|less(X1,X2)|less(X2,X1))).
% 0.12/0.37 cnf(i_0_165, negated_conjecture, (times(X1,X2)=X1|X1=n1|times(X1,X2)!=p__0)).
% 0.12/0.37 cnf(i_0_139, negated_conjecture, (plus(X1,times(X2,p__0))!=times(X3,p__0)|~less(X1,n0)|~less(X1,p__0))).
% 0.12/0.37 cnf(i_0_149, negated_conjecture, (plus(X1,times(X2,p__0))!=times(X3,p__0)|~less(X1,p__0)|~less(n0,X1))).
% 0.12/0.37 cnf(i_0_133, negated_conjecture, (times(p__0,s_6(p__0,X1))=X1|s_5(p__0,X1)!=n0)).
% 0.12/0.37 cnf(i_0_286, plain, (X6=X6)).
% 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_286, plain, (plus(n0,times(X11,plus(X1,n1)))=plus(n0,times(X11,plus(X1,n1)))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_360, plain, (plus(n0,times(X11,plus(X1,n1)))=plus(n0,times(X11,plus(X1,n1)))), inference(extension_rule, [i_0_92])).
% 0.12/0.37 cnf(i_0_368, plain, (~less(n0,plus(X1,n1))), inference(closure_rule, [i_0_121])).
% 0.12/0.37 cnf(i_0_369, plain, (~less(n0,plus(X1,n1))), inference(closure_rule, [i_0_121])).
% 0.12/0.37 cnf(i_0_370, plain, (~less(n0,n0)), inference(extension_rule, [i_0_125])).
% 0.12/0.37 cnf(i_0_386, plain, (~less(plus(n0,n1),n0)), inference(etableau_closure_rule, [i_0_386, ...])).
% 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 (16992) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------