0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.33 Computer : n019.cluster.edu 0.13/0.33 Model : x86_64 x86_64 0.13/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 RAMPerCPU : 8042.1875MB 0.13/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 02:19:21 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.41 # No SInE strategy applied 0.19/0.41 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N 0.19/0.41 # and selection function SelectUnlessUniqMax. 0.19/0.41 # 0.19/0.41 # Presaturation interreduction done 0.19/0.41 # Number of axioms: 178 Number of unprocessed: 107 0.19/0.41 # Tableaux proof search. 0.19/0.41 # APR header successfully linked. 0.19/0.41 # Hello from C++ 0.19/0.44 # The folding up rule is enabled... 0.19/0.44 # Local unification is enabled... 0.19/0.44 # Any saturation attempts will use folding labels... 0.19/0.44 # 107 beginning clauses after preprocessing and clausification 0.19/0.44 # Creating start rules for all 1 conjectures. 0.19/0.44 # There are 1 start rule candidates: 0.19/0.44 # Found 29 unit axioms. 0.19/0.44 # 1 start rule tableaux created. 0.19/0.44 # 78 extension rule candidate clauses 0.19/0.44 # 29 unit axiom clauses 0.19/0.44 0.19/0.44 # Requested 8, 32 cores available to the main process. 0.19/0.44 # There are not enough tableaux to fork, creating more from the initial 1 0.19/0.46 # There were 2 total branch saturation attempts. 0.19/0.46 # There were 0 of these attempts blocked. 0.19/0.46 # There were 0 deferred branch saturation attempts. 0.19/0.46 # There were 0 free duplicated saturations. 0.19/0.46 # There were 2 total successful branch saturations. 0.19/0.46 # There were 0 successful branch saturations in interreduction. 0.19/0.46 # There were 0 successful branch saturations on the branch. 0.19/0.46 # There were 2 successful branch saturations after the branch. 0.19/0.46 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.46 # Begin clausification derivation 0.19/0.46 0.19/0.46 # End clausification derivation 0.19/0.46 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.46 cnf(i_0_95, negated_conjecture, (holdsAt(spinning,n1))). 0.19/0.46 cnf(i_0_69, plain, (plus(n1,n1)=n2)). 0.19/0.46 cnf(i_0_86, plain, (plus(n1,n2)=n3)). 0.19/0.46 cnf(i_0_94, plain, (plus(n1,n3)=n4)). 0.19/0.46 cnf(i_0_55, plain, (plus(n0,n0)=n0)). 0.19/0.46 cnf(i_0_57, plain, (plus(n3,n3)=n6)). 0.19/0.46 cnf(i_0_75, plain, (plus(n2,n2)=n4)). 0.19/0.46 cnf(i_0_82, plain, (plus(n2,n3)=n5)). 0.19/0.46 cnf(i_0_90, plain, (plus(n0,n3)=n3)). 0.19/0.46 cnf(i_0_48, plain, (happens(pull,n1))). 0.19/0.46 cnf(i_0_66, plain, (plus(n1,n0)=n1)). 0.19/0.46 cnf(i_0_79, plain, (less_or_equal(X1,X1))). 0.19/0.46 cnf(i_0_49, plain, (happens(push,n2))). 0.19/0.46 cnf(i_0_47, plain, (happens(push,n0))). 0.19/0.46 cnf(i_0_50, plain, (happens(pull,n2))). 0.19/0.46 cnf(i_0_56, plain, (plus(n2,n0)=n2)). 0.19/0.46 cnf(i_0_128, plain, (epred2_3(forwards,pull,X1))). 0.19/0.46 cnf(i_0_93, plain, (plus(X1,X2)=plus(X2,X1))). 0.19/0.46 cnf(i_0_54, plain, (spinning!=backwards)). 0.19/0.46 cnf(i_0_52, plain, (forwards!=spinning)). 0.19/0.46 cnf(i_0_83, hypothesis, (~holdsAt(spinning,n0))). 0.19/0.46 cnf(i_0_26, plain, (forwards!=backwards)). 0.19/0.46 cnf(i_0_53, plain, (push!=pull)). 0.19/0.46 cnf(i_0_61, hypothesis, (~releasedAt(X1,X2))). 0.19/0.46 cnf(i_0_72, plain, (~less(X1,n0))). 0.19/0.46 cnf(i_0_81, hypothesis, (~holdsAt(forwards,n0))). 0.19/0.46 cnf(i_0_87, hypothesis, (~holdsAt(backwards,n0))). 0.19/0.46 cnf(i_0_51, plain, (~releases(X1,X2,X3))). 0.19/0.46 cnf(i_0_60, plain, (~less(X1,X1))). 0.19/0.46 cnf(i_0_59, plain, (~less(X1,X2)|~less(X2,X1))). 0.19/0.46 cnf(i_0_131, plain, (pull=X1|~epred2_3(X2,X1,X3))). 0.19/0.46 cnf(i_0_63, plain, (less(X1,n1)|~less_or_equal(X1,n0))). 0.19/0.46 cnf(i_0_91, plain, (less(X1,n2)|~less_or_equal(X1,n1))). 0.19/0.46 cnf(i_0_92, plain, (less_or_equal(X1,n1)|~less(X1,n2))). 0.19/0.46 cnf(i_0_62, plain, (less_or_equal(X1,n0)|~less(X1,n1))). 0.19/0.46 cnf(i_0_84, plain, (less(X1,n6)|~less_or_equal(X1,n5))). 0.19/0.46 cnf(i_0_67, plain, (less(X1,n3)|~less_or_equal(X1,n2))). 0.19/0.46 cnf(i_0_89, plain, (less(X1,n8)|~less_or_equal(X1,n7))). 0.19/0.46 cnf(i_0_65, plain, (less(X1,n9)|~less_or_equal(X1,n8))). 0.19/0.46 cnf(i_0_71, plain, (less(X1,n4)|~less_or_equal(X1,n3))). 0.19/0.46 cnf(i_0_74, plain, (less(X1,n5)|~less_or_equal(X1,n4))). 0.19/0.46 cnf(i_0_76, plain, (less(X1,n7)|~less_or_equal(X1,n6))). 0.19/0.46 cnf(i_0_68, plain, (less_or_equal(X1,n2)|~less(X1,n3))). 0.19/0.46 cnf(i_0_77, plain, (less_or_equal(X1,n6)|~less(X1,n7))). 0.19/0.46 cnf(i_0_70, plain, (less_or_equal(X1,n3)|~less(X1,n4))). 0.19/0.46 cnf(i_0_78, plain, (less_or_equal(X1,X2)|~less(X1,X2))). 0.19/0.46 cnf(i_0_28, plain, (epred1_3(X1,X2,X3)|~initiates(X2,X3,X1))). 0.19/0.46 cnf(i_0_29, plain, (epred3_3(X1,X2,X3)|~terminates(X1,X3,X2))). 0.19/0.46 cnf(i_0_64, plain, (less_or_equal(X1,n8)|~less(X1,n9))). 0.19/0.46 cnf(i_0_73, plain, (less_or_equal(X1,n4)|~less(X1,n5))). 0.19/0.46 cnf(i_0_85, plain, (less_or_equal(X1,n5)|~less(X1,n6))). 0.19/0.46 cnf(i_0_88, plain, (less_or_equal(X1,n7)|~less(X1,n8))). 0.19/0.46 cnf(i_0_33, plain, (push=X1|pull=X1|~happens(X1,X2))). 0.19/0.46 cnf(i_0_123, plain, (X1=pull|~epred1_3(X2,X1,X3)|~happens(pull,X2))). 0.19/0.46 cnf(i_0_80, plain, (X1=X2|less(X1,X2)|~less_or_equal(X1,X2))). 0.19/0.46 cnf(i_0_27, plain, (initiates(X1,X2,X3)|~epred1_3(X3,X1,X2))). 0.19/0.46 cnf(i_0_144, plain, (X1=backwards|X1=forwards|~epred2_3(X1,X2,X3))). 0.19/0.46 cnf(i_0_125, plain, (X1=push|X1=pull|~epred1_3(X2,X1,X3))). 0.19/0.46 cnf(i_0_44, plain, (n2=X1|X1=n0|X1=n1|~happens(X2,X1))). 0.19/0.46 cnf(i_0_30, plain, (terminates(X1,X2,X3)|~epred3_3(X1,X3,X2))). 0.19/0.46 cnf(i_0_159, plain, (epred3_3(X1,X2,X3)|~epred2_3(X3,X1,X2))). 0.19/0.46 cnf(i_0_124, plain, (forwards=X1|X2=pull|~epred1_3(X3,X2,X1))). 0.19/0.46 cnf(i_0_39, plain, (n2=X1|push=X2|X1=n1|~happens(X2,X1))). 0.19/0.46 cnf(i_0_38, plain, (n2=X1|pull=X2|X1=n0|~happens(X2,X1))). 0.19/0.46 cnf(i_0_17, plain, (~holdsAt(X1,plus(X2,n1))|~terminates(X3,X1,X2)|~happens(X3,X2))). 0.19/0.46 cnf(i_0_145, plain, (X1=forwards|happens(push,X2)|~epred2_3(X1,X3,X2))). 0.19/0.46 cnf(i_0_102, plain, (X1=spinning|~epred1_3(X2,X3,X1)|~happens(pull,X2)|~happens(push,X2))). 0.19/0.46 cnf(i_0_104, plain, (X1=push|X2=spinning|~epred1_3(X3,X1,X2)|~happens(push,X3))). 0.19/0.46 cnf(i_0_58, plain, (X1=X2|less(X1,X2)|less(X2,X1))). 0.19/0.46 cnf(i_0_101, plain, (backwards=X1|X2=push|X1=spinning|~epred1_3(X3,X2,X1))). 0.19/0.46 cnf(i_0_100, plain, (backwards=X1|forwards=X1|X1=spinning|~epred1_3(X2,X3,X1))). 0.19/0.46 cnf(i_0_99, plain, (backwards=X1|X1=spinning|~epred1_3(X2,X3,X1)|~happens(pull,X2))). 0.19/0.46 cnf(i_0_103, plain, (forwards=X1|X1=spinning|~epred1_3(X2,X3,X1)|~happens(push,X2))). 0.19/0.46 cnf(i_0_164, plain, (epred2_3(X1,X2,X3)|~epred3_3(X2,X3,X1)|~happens(pull,X3)|~happens(push,X3))). 0.19/0.46 cnf(i_0_16, plain, (holdsAt(X1,plus(X2,n1))|~initiates(X3,X1,X2)|~happens(X3,X2))). 0.19/0.46 cnf(i_0_108, plain, (backwards=X1|happens(push,X2)|~epred1_3(X2,X3,X1)|~happens(pull,X2))). 0.19/0.46 cnf(i_0_4, plain, (less(X1,esk2_3(X1,X2,X3))|~startedIn(X1,X3,X2))). 0.19/0.46 cnf(i_0_9, plain, (less(X1,esk5_3(X1,X2,X3))|~stoppedIn(X1,X2,X3))). 0.19/0.46 cnf(i_0_2, plain, (less(esk2_3(X1,X2,X3),X2)|~startedIn(X1,X3,X2))). 0.19/0.46 cnf(i_0_11, plain, (less(esk5_3(X1,X2,X3),X3)|~stoppedIn(X1,X2,X3))). 0.19/0.46 cnf(i_0_167, plain, (X1=pull|~epred3_3(X1,X2,X3)|~happens(pull,X2))). 0.19/0.46 cnf(i_0_181, plain, (push=X1|epred2_3(X2,X1,X3)|~epred3_3(X1,X3,X2)|~happens(push,X3))). 0.19/0.46 cnf(i_0_110, plain, (backwards=X1|X2=push|happens(push,X3)|~epred1_3(X3,X2,X1))). 0.19/0.46 cnf(i_0_109, plain, (backwards=X1|forwards=X1|happens(push,X2)|~epred1_3(X2,X3,X1))). 0.19/0.46 cnf(i_0_171, plain, (spinning=X1|X1=backwards|epred2_3(X1,X2,X3)|~epred3_3(X2,X3,X1))). 0.19/0.46 cnf(i_0_161, plain, (spinning=X1|epred2_3(X1,X2,X3)|~epred3_3(X2,X3,X1)|~happens(pull,X3))). 0.19/0.46 cnf(i_0_184, plain, (push=X1|X1=pull|~epred3_3(X1,X2,X3))). 0.19/0.46 cnf(i_0_169, plain, (spinning=X1|push=X2|epred2_3(X1,X2,X3)|~epred3_3(X2,X3,X1))). 0.19/0.46 cnf(i_0_23, plain, (holdsAt(X1,plus(X2,n1))|happens(esk7_2(X1,X2),X2)|~holdsAt(X1,X2))). 0.19/0.46 cnf(i_0_15, plain, (holdsAt(X1,X2)|happens(esk6_2(X1,X2),X2)|~holdsAt(X1,plus(X2,n1)))). 0.19/0.46 cnf(i_0_5, plain, (happens(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))|~startedIn(X1,X3,X2))). 0.19/0.46 cnf(i_0_12, plain, (happens(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3))|~stoppedIn(X1,X2,X3))). 0.19/0.46 cnf(i_0_14, plain, (holdsAt(X1,X2)|initiates(esk6_2(X1,X2),X1,X2)|~holdsAt(X1,plus(X2,n1)))). 0.19/0.46 cnf(i_0_22, plain, (holdsAt(X1,plus(X2,n1))|terminates(esk7_2(X1,X2),X1,X2)|~holdsAt(X1,X2))). 0.19/0.46 cnf(i_0_3, plain, (initiates(esk1_3(X1,X2,X3),X3,esk2_3(X1,X2,X3))|~startedIn(X1,X3,X2))). 0.19/0.46 cnf(i_0_1, plain, (startedIn(X1,X2,X3)|~initiates(X4,X2,X5)|~less(X1,X5)|~less(X5,X3)|~happens(X4,X5))). 0.19/0.46 cnf(i_0_8, plain, (stoppedIn(X1,X2,X3)|~terminates(X4,X2,X5)|~less(X1,X5)|~less(X5,X3)|~happens(X4,X5))). 0.19/0.46 cnf(i_0_10, plain, (terminates(esk4_3(X1,X2,X3),X2,esk5_3(X1,X2,X3))|~stoppedIn(X1,X2,X3))). 0.19/0.46 cnf(i_0_18, plain, (holdsAt(X1,plus(X2,X3))|startedIn(X2,X4,plus(X2,X3))|~antitrajectory(X4,X2,X1,X3)|~terminates(X5,X4,X2)|~less(n0,X3)|~happens(X5,X2))). 0.19/0.46 cnf(i_0_13, plain, (holdsAt(X1,plus(X2,X3))|stoppedIn(X2,X4,plus(X2,X3))|~trajectory(X4,X2,X1,X3)|~initiates(X5,X4,X2)|~less(n0,X3)|~happens(X5,X2))). 0.19/0.46 cnf(i_0_98, plain, (epred1_3(X1,pull,spinning)|~happens(push,X1))). 0.19/0.46 cnf(i_0_126, plain, (epred2_3(backwards,pull,X1)|~happens(push,X1))). 0.19/0.46 cnf(i_0_158, plain, (epred3_3(push,X1,spinning)|happens(pull,X1))). 0.19/0.46 cnf(i_0_157, plain, (epred3_3(pull,X1,spinning)|happens(push,X1))). 0.19/0.46 cnf(i_0_96, plain, (epred1_3(X1,push,forwards)|happens(pull,X1))). 0.19/0.46 cnf(i_0_156, plain, (epred3_3(push,X1,backwards)|happens(pull,X1))). 0.19/0.46 cnf(i_0_97, plain, (epred1_3(X1,pull,backwards)|happens(push,X1))). 0.19/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.46 # Begin printing tableau 0.19/0.46 # Found 6 steps 0.19/0.46 cnf(i_0_95, negated_conjecture, (holdsAt(spinning,n1)), inference(start_rule)). 0.19/0.46 cnf(i_0_215, plain, (holdsAt(spinning,n1)), inference(extension_rule, [i_0_22])). 0.19/0.46 cnf(i_0_393, plain, (holdsAt(spinning,plus(n1,n1))), inference(extension_rule, [i_0_17])). 0.19/0.46 cnf(i_0_520, plain, (~happens(pull,n1)), inference(closure_rule, [i_0_48])). 0.19/0.46 cnf(i_0_394, plain, (terminates(esk7_2(spinning,n1),spinning,n1)), inference(etableau_closure_rule, [i_0_394, ...])). 0.19/0.46 cnf(i_0_519, plain, (~terminates(pull,spinning,n1)), inference(etableau_closure_rule, [i_0_519, ...])). 0.19/0.46 # End printing tableau 0.19/0.46 # SZS output end 0.19/0.46 # Branches closed with saturation will be marked with an "s" 0.19/0.46 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. 0.19/0.46 # We now have 2 tableaux to operate on 0.19/0.46 # Found closed tableau during pool population. 0.19/0.46 # Proof search is over... 0.19/0.46 # Freeing feature tree 0.19/0.47 EOF