TSTP Solution File: NUM422+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM422+1 : 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 : n003.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:51 EDT 2022
% Result : Theorem 28.35s 3.84s
% Output : CNFRefutation 28.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : NUM422+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.08 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.27 % Computer : n003.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Thu Jul 7 07:59:12 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.07/0.28 # No SInE strategy applied
% 0.07/0.28 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.07/0.28 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.07/0.28 #
% 0.07/0.28 # Presaturation interreduction done
% 0.07/0.28 # Number of axioms: 21 Number of unprocessed: 21
% 0.07/0.28 # Tableaux proof search.
% 0.07/0.28 # APR header successfully linked.
% 0.07/0.28 # Hello from C++
% 0.07/0.28 # The folding up rule is enabled...
% 0.07/0.28 # Local unification is enabled...
% 0.07/0.28 # Any saturation attempts will use folding labels...
% 0.07/0.28 # 21 beginning clauses after preprocessing and clausification
% 0.07/0.28 # Creating start rules for all 1 conjectures.
% 0.07/0.28 # There are 1 start rule candidates:
% 0.07/0.28 # Found 4 unit axioms.
% 0.07/0.28 # 1 start rule tableaux created.
% 0.07/0.28 # 17 extension rule candidate clauses
% 0.07/0.28 # 4 unit axiom clauses
% 0.07/0.28
% 0.07/0.28 # Requested 8, 32 cores available to the main process.
% 0.07/0.28 # There are not enough tableaux to fork, creating more from the initial 1
% 0.07/0.28 # Creating equality axioms
% 0.07/0.28 # Ran out of tableaux, making start rules for all clauses
% 0.07/0.28 # Returning from population with 51 new_tableaux and 0 remaining starting tableaux.
% 0.07/0.28 # We now have 51 tableaux to operate on
% 28.35/3.84 # There were 3 total branch saturation attempts.
% 28.35/3.84 # There were 0 of these attempts blocked.
% 28.35/3.84 # There were 0 deferred branch saturation attempts.
% 28.35/3.84 # There were 0 free duplicated saturations.
% 28.35/3.84 # There were 2 total successful branch saturations.
% 28.35/3.84 # There were 0 successful branch saturations in interreduction.
% 28.35/3.84 # There were 0 successful branch saturations on the branch.
% 28.35/3.84 # There were 2 successful branch saturations after the branch.
% 28.35/3.84 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.35/3.84 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.35/3.84 # Begin clausification derivation
% 28.35/3.84
% 28.35/3.84 # End clausification derivation
% 28.35/3.84 # Begin listing active clauses obtained from FOF to CNF conversion
% 28.35/3.84 cnf(i_0_3, plain, (aInteger0(sz10))).
% 28.35/3.84 cnf(i_0_21, hypothesis, (aInteger0(xa))).
% 28.35/3.84 cnf(i_0_2, plain, (aInteger0(sz00))).
% 28.35/3.84 cnf(i_0_22, negated_conjecture, (sdtasdt0(smndt0(sz10),xa)!=smndt0(xa))).
% 28.35/3.84 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_4, plain, (aInteger0(smndt0(X1))|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_19, plain, (sdtasdt0(sz00,X1)=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_20, plain, (sdtasdt0(X1,sz00)=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_6, plain, (aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_5, plain, (aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_14, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_8, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_13, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_7, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aInteger0(X2)|~aInteger0(X3)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_70, plain, (X26=X26)).
% 28.35/3.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 28.35/3.84 # Begin printing tableau
% 28.35/3.84 # Found 8 steps
% 28.35/3.84 cnf(i_0_3, plain, (aInteger0(sz10)), inference(start_rule)).
% 28.35/3.84 cnf(i_0_78, plain, (aInteger0(sz10)), inference(extension_rule, [i_0_17])).
% 28.35/3.84 cnf(i_0_172, plain, (~aInteger0(sz10)), inference(closure_rule, [i_0_3])).
% 28.35/3.84 cnf(i_0_173, plain, (~aInteger0(sz10)), inference(closure_rule, [i_0_3])).
% 28.35/3.84 cnf(i_0_171, plain, (sdtpldt0(sdtasdt0(sz10,sz10),sdtasdt0(sz10,sz10))=sdtasdt0(sdtpldt0(sz10,sz10),sz10)), inference(extension_rule, [i_0_74])).
% 28.35/3.84 cnf(i_0_578, plain, (aInteger0(sdtasdt0(sdtpldt0(sz10,sz10),sz10))), inference(extension_rule, [i_0_15])).
% 28.35/3.84 cnf(i_0_580, plain, (~aInteger0(sdtpldt0(sdtasdt0(sz10,sz10),sdtasdt0(sz10,sz10)))), inference(etableau_closure_rule, [i_0_580, ...])).
% 28.35/3.84 cnf(i_0_238771, plain, (sdtasdt0(sz10,sdtasdt0(sdtpldt0(sz10,sz10),sz10))=sdtasdt0(sdtpldt0(sz10,sz10),sz10)), inference(etableau_closure_rule, [i_0_238771, ...])).
% 28.35/3.84 # End printing tableau
% 28.35/3.84 # SZS output end
% 28.35/3.84 # Branches closed with saturation will be marked with an "s"
% 28.35/3.84 # There were 3 total branch saturation attempts.
% 28.35/3.84 # There were 0 of these attempts blocked.
% 28.35/3.84 # There were 0 deferred branch saturation attempts.
% 28.35/3.84 # There were 0 free duplicated saturations.
% 28.35/3.84 # There were 2 total successful branch saturations.
% 28.35/3.84 # There were 0 successful branch saturations in interreduction.
% 28.35/3.84 # There were 0 successful branch saturations on the branch.
% 28.35/3.84 # There were 2 successful branch saturations after the branch.
% 28.35/3.84 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.35/3.84 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.35/3.84 # Begin clausification derivation
% 28.35/3.84
% 28.35/3.84 # End clausification derivation
% 28.35/3.84 # Begin listing active clauses obtained from FOF to CNF conversion
% 28.35/3.84 cnf(i_0_3, plain, (aInteger0(sz10))).
% 28.35/3.84 cnf(i_0_21, hypothesis, (aInteger0(xa))).
% 28.35/3.84 cnf(i_0_2, plain, (aInteger0(sz00))).
% 28.35/3.84 cnf(i_0_22, negated_conjecture, (sdtasdt0(smndt0(sz10),xa)!=smndt0(xa))).
% 28.35/3.84 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_4, plain, (aInteger0(smndt0(X1))|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_19, plain, (sdtasdt0(sz00,X1)=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_20, plain, (sdtasdt0(X1,sz00)=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_6, plain, (aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_5, plain, (aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_14, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_8, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_13, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_7, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aInteger0(X2)|~aInteger0(X3)|~aInteger0(X1))).
% 28.35/3.84 cnf(i_0_70, plain, (X26=X26)).
% 28.35/3.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 28.35/3.84 # Begin printing tableau
% 28.35/3.84 # Found 8 steps
% 28.35/3.84 cnf(i_0_3, plain, (aInteger0(sz10)), inference(start_rule)).
% 28.35/3.84 cnf(i_0_78, plain, (aInteger0(sz10)), inference(extension_rule, [i_0_17])).
% 28.35/3.84 cnf(i_0_173, plain, (~aInteger0(sz10)), inference(closure_rule, [i_0_3])).
% 28.35/3.84 cnf(i_0_174, plain, (~aInteger0(sz10)), inference(closure_rule, [i_0_3])).
% 28.35/3.84 cnf(i_0_171, plain, (sdtpldt0(sdtasdt0(sz10,sz10),sdtasdt0(sz10,sz10))=sdtasdt0(sdtpldt0(sz10,sz10),sz10)), inference(extension_rule, [i_0_74])).
% 28.35/3.84 cnf(i_0_578, plain, (aInteger0(sdtasdt0(sdtpldt0(sz10,sz10),sz10))), inference(extension_rule, [i_0_15])).
% 28.35/3.84 cnf(i_0_580, plain, (~aInteger0(sdtpldt0(sdtasdt0(sz10,sz10),sdtasdt0(sz10,sz10)))), inference(etableau_closure_rule, [i_0_580, ...])).
% 28.35/3.84 cnf(i_0_238771, plain, (sdtasdt0(sz10,sdtasdt0(sdtpldt0(sz10,sz10),sz10))=sdtasdt0(sdtpldt0(sz10,sz10),sz10)), inference(etableau_closure_rule, [i_0_238771, ...])).
% 28.35/3.84 # End printing tableau
% 28.35/3.84 # SZS output end
% 28.35/3.84 # Branches closed with saturation will be marked with an "s"
% 28.35/3.85 # Child (4518) has found a proof.
% 28.35/3.85
% 28.35/3.85 # Proof search is over...
% 28.35/3.85 # Freeing feature tree
%------------------------------------------------------------------------------