TSTP Solution File: NUM435+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM435+3 : 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 : n029.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:41:00 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM435+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : n029.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 06:43:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.38 # No SInE strategy applied
% 0.19/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.19/0.38 # and selection function SelectCQArNTNpEqFirst.
% 0.19/0.38 #
% 0.19/0.38 # Presaturation interreduction done
% 0.19/0.38 # Number of axioms: 46 Number of unprocessed: 46
% 0.19/0.38 # Tableaux proof search.
% 0.19/0.38 # APR header successfully linked.
% 0.19/0.38 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 46 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 1 conjectures.
% 0.19/0.38 # There are 1 start rule candidates:
% 0.19/0.38 # Found 16 unit axioms.
% 0.19/0.38 # 1 start rule tableaux created.
% 0.19/0.38 # 30 extension rule candidate clauses
% 0.19/0.38 # 16 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # Returning from population with 59 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.38 # We now have 59 tableaux to operate on
% 0.19/0.49 # There were 6 total branch saturation attempts.
% 0.19/0.49 # There were 0 of these attempts blocked.
% 0.19/0.49 # There were 0 deferred branch saturation attempts.
% 0.19/0.49 # There were 2 free duplicated saturations.
% 0.19/0.49 # There were 6 total successful branch saturations.
% 0.19/0.49 # There were 0 successful branch saturations in interreduction.
% 0.19/0.49 # There were 0 successful branch saturations on the branch.
% 0.19/0.49 # There were 4 successful branch saturations after the branch.
% 0.19/0.49 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # Begin clausification derivation
% 0.19/0.49
% 0.19/0.49 # End clausification derivation
% 0.19/0.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.49 cnf(i_0_45, hypothesis, (sdtpldt0(xa,smndt0(xb))=sdtasdt0(sdtasdt0(xp,xq),xm))).
% 0.19/0.49 cnf(i_0_39, hypothesis, (aInteger0(xa))).
% 0.19/0.49 cnf(i_0_2, plain, (aInteger0(sz00))).
% 0.19/0.49 cnf(i_0_3, plain, (aInteger0(sz10))).
% 0.19/0.49 cnf(i_0_38, hypothesis, (aInteger0(xb))).
% 0.19/0.49 cnf(i_0_37, hypothesis, (aInteger0(xp))).
% 0.19/0.49 cnf(i_0_35, hypothesis, (aInteger0(xq))).
% 0.19/0.49 cnf(i_0_42, hypothesis, (sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtasdt0(sdtasdt0(xp,xq),xm))).
% 0.19/0.49 cnf(i_0_46, hypothesis, (aInteger0(xm))).
% 0.19/0.49 cnf(i_0_40, hypothesis, (sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)))).
% 0.19/0.49 cnf(i_0_41, hypothesis, (aDivisorOf0(sdtasdt0(xp,xq),sdtasdt0(sdtasdt0(xp,xq),xm)))).
% 0.19/0.49 cnf(i_0_43, hypothesis, (aInteger0(esk2_0))).
% 0.19/0.49 cnf(i_0_36, hypothesis, (xp!=sz00)).
% 0.19/0.49 cnf(i_0_34, hypothesis, (xq!=sz00)).
% 0.19/0.49 cnf(i_0_44, hypothesis, (sdtasdt0(xp,xq)!=sz00)).
% 0.19/0.49 cnf(i_0_47, negated_conjecture, (sdtasdt0(sdtasdt0(xp,xq),xm)!=sdtasdt0(xq,sdtasdt0(xp,xm)))).
% 0.19/0.49 cnf(i_0_4, plain, (aInteger0(smndt0(X1))|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_27, plain, (~aDivisorOf0(sz00,X1)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_28, plain, (aInteger0(X1)|~aDivisorOf0(X1,X2)|~aInteger0(X2))).
% 0.19/0.49 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_19, plain, (sdtasdt0(sz00,X1)=sz00|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_20, plain, (sdtasdt0(X1,sz00)=sz00|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_5, plain, (aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_6, plain, (aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_26, plain, (aInteger0(esk1_2(X1,X2))|~aDivisorOf0(X2,X1)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_21, plain, (sdtasdt0(X1,smndt0(sz10))=smndt0(X1)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_22, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_8, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_14, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_23, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_25, plain, (sdtasdt0(X1,esk1_2(X2,X1))=X2|~aDivisorOf0(X1,X2)|~aInteger0(X2))).
% 0.19/0.49 cnf(i_0_31, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X2,X1)|~aInteger0(X1)|~aInteger0(X2))).
% 0.19/0.49 cnf(i_0_29, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X3,X1)|~aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_32, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X3,X1)|~sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3))).
% 0.19/0.49 cnf(i_0_24, plain, (X1=sz00|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_7, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_13, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aInteger0(X2)|~aInteger0(X3)|~aInteger0(X1))).
% 0.19/0.49 cnf(i_0_30, plain, (X1=sz00|aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))|~sdteqdtlpzmzozddtrp0(X2,X3,X1)|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2))).
% 0.19/0.49 cnf(i_0_33, plain, (X1=sz00|sdteqdtlpzmzozddtrp0(X2,X3,X1)|~sdteqdtlpzmzozddtrp0(X4,X3,X1)|~sdteqdtlpzmzozddtrp0(X2,X4,X1)|~aInteger0(X3)|~aInteger0(X1)|~aInteger0(X4)|~aInteger0(X2))).
% 0.19/0.49 cnf(i_0_151, plain, (X48=X48)).
% 0.19/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.49 # Begin printing tableau
% 0.19/0.49 # Found 11 steps
% 0.19/0.49 cnf(i_0_45, hypothesis, (sdtpldt0(xa,smndt0(xb))=sdtasdt0(sdtasdt0(xp,xq),xm)), inference(start_rule)).
% 0.19/0.49 cnf(i_0_161, plain, (sdtpldt0(xa,smndt0(xb))=sdtasdt0(sdtasdt0(xp,xq),xm)), inference(extension_rule, [i_0_160])).
% 0.19/0.49 cnf(i_0_402, plain, (sdtpldt0(xa,smndt0(xb))!=sdtasdt0(sdtasdt0(xp,xq),xm)), inference(closure_rule, [i_0_45])).
% 0.19/0.49 cnf(i_0_403, plain, (sdtpldt0(xa,smndt0(xb))!=sdtasdt0(sdtasdt0(xp,xq),xm)), inference(closure_rule, [i_0_45])).
% 0.19/0.49 cnf(i_0_400, plain, (sdteqdtlpzmzozddtrp0(sdtasdt0(sdtasdt0(xp,xq),xm),sdtasdt0(sdtasdt0(xp,xq),xm),sdtasdt0(sdtasdt0(xp,xq),xm))), inference(extension_rule, [i_0_30])).
% 0.19/0.49 cnf(i_0_404, plain, (~sdteqdtlpzmzozddtrp0(sdtpldt0(xa,smndt0(xb)),sdtpldt0(xa,smndt0(xb)),sdtpldt0(xa,smndt0(xb)))), inference(etableau_closure_rule, [i_0_404, ...])).
% 0.19/0.49 cnf(i_0_491, plain, (sdtasdt0(sdtasdt0(xp,xq),xm)=sz00), inference(etableau_closure_rule, [i_0_491, ...])).
% 0.19/0.49 cnf(i_0_492, plain, (aDivisorOf0(sdtasdt0(sdtasdt0(xp,xq),xm),sdtpldt0(sdtasdt0(sdtasdt0(xp,xq),xm),smndt0(sdtasdt0(sdtasdt0(xp,xq),xm))))), inference(etableau_closure_rule, [i_0_492, ...])).
% 0.19/0.49 cnf(i_0_494, plain, (~aInteger0(sdtasdt0(sdtasdt0(xp,xq),xm))), inference(etableau_closure_rule, [i_0_494, ...])).
% 0.19/0.49 cnf(i_0_495, plain, (~aInteger0(sdtasdt0(sdtasdt0(xp,xq),xm))), inference(etableau_closure_rule, [i_0_495, ...])).
% 0.19/0.49 cnf(i_0_496, plain, (~aInteger0(sdtasdt0(sdtasdt0(xp,xq),xm))), inference(etableau_closure_rule, [i_0_496, ...])).
% 0.19/0.49 # End printing tableau
% 0.19/0.49 # SZS output end
% 0.19/0.49 # Branches closed with saturation will be marked with an "s"
% 0.19/0.49 # Child (23821) has found a proof.
% 0.19/0.49
% 0.19/0.49 # Proof search is over...
% 0.19/0.49 # Freeing feature tree
%------------------------------------------------------------------------------