TSTP Solution File: NUM425+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM425+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 : n015.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:53 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM425+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 20:44:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.13/0.37 # and selection function SelectCQArNTNpEqFirst.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 36 Number of unprocessed: 36
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 36 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 7 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 29 extension rule candidate clauses
% 0.13/0.38 # 7 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Returning from population with 85 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 85 tableaux to operate on
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_35, hypothesis, (aInteger0(xa))).
% 0.13/0.39 cnf(i_0_34, hypothesis, (aInteger0(xb))).
% 0.13/0.39 cnf(i_0_33, hypothesis, (aInteger0(xq))).
% 0.13/0.39 cnf(i_0_2, plain, (aInteger0(sz00))).
% 0.13/0.39 cnf(i_0_3, plain, (aInteger0(sz10))).
% 0.13/0.39 cnf(i_0_36, hypothesis, (sdteqdtlpzmzozddtrp0(xa,xb,xq))).
% 0.13/0.39 cnf(i_0_32, hypothesis, (xq!=sz00)).
% 0.13/0.39 cnf(i_0_27, plain, (~aDivisorOf0(sz00,X1)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_28, plain, (aInteger0(X1)|~aDivisorOf0(X1,X2)|~aInteger0(X2))).
% 0.13/0.39 cnf(i_0_4, plain, (aInteger0(smndt0(X1))|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_19, plain, (sdtasdt0(sz00,X1)=sz00|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_37, negated_conjecture, (sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_20, plain, (sdtasdt0(X1,sz00)=sz00|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_5, plain, (aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_6, plain, (aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_26, plain, (aInteger0(esk1_2(X1,X2))|~aDivisorOf0(X2,X1)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_21, plain, (sdtasdt0(X1,smndt0(sz10))=smndt0(X1)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_22, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_8, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_14, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_23, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_31, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X2,X1)|~aInteger0(X1)|~aInteger0(X2))).
% 0.13/0.39 cnf(i_0_25, plain, (sdtasdt0(X1,esk1_2(X2,X1))=X2|~aDivisorOf0(X1,X2)|~aInteger0(X2))).
% 0.13/0.39 cnf(i_0_29, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X3,X1)|~aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_24, plain, (X1=sz00|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_7, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_13, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aInteger0(X2)|~aInteger0(X3)|~aInteger0(X1))).
% 0.13/0.39 cnf(i_0_30, plain, (X1=sz00|aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))|~sdteqdtlpzmzozddtrp0(X2,X3,X1)|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2))).
% 0.13/0.39 cnf(i_0_130, plain, (X40=X40)).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_35, hypothesis, (aInteger0(xa)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_140, plain, (aInteger0(xa)), inference(extension_rule, [i_0_134])).
% 0.13/0.39 cnf(i_0_331, plain, (aInteger0(xa)), inference(extension_rule, [i_0_27])).
% 0.13/0.39 cnf(i_0_332, plain, ($false), inference(closure_rule, [i_0_130])).
% 0.13/0.39 cnf(i_0_351, plain, (~aDivisorOf0(sz00,xa)), inference(etableau_closure_rule, [i_0_351, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (3255) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------