TSTP Solution File: CSR019+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.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 : n013.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 : Fri Jul 15 03:04:12 EDT 2022
% Result : Theorem 0.18s 0.41s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.12/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 : n013.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.18/0.33 % DateTime : Sat Jun 11 01:08:43 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.18/0.37 # and selection function SelectUnlessUniqMax.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 177 Number of unprocessed: 110
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.39 # The folding up rule is enabled...
% 0.18/0.39 # Local unification is enabled...
% 0.18/0.39 # Any saturation attempts will use folding labels...
% 0.18/0.39 # 110 beginning clauses after preprocessing and clausification
% 0.18/0.39 # Creating start rules for all 1 conjectures.
% 0.18/0.39 # There are 1 start rule candidates:
% 0.18/0.39 # Found 29 unit axioms.
% 0.18/0.39 # 1 start rule tableaux created.
% 0.18/0.39 # 81 extension rule candidate clauses
% 0.18/0.39 # 29 unit axiom clauses
% 0.18/0.39
% 0.18/0.39 # Requested 8, 32 cores available to the main process.
% 0.18/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.41 # There were 2 total branch saturation attempts.
% 0.18/0.41 # There were 0 of these attempts blocked.
% 0.18/0.41 # There were 0 deferred branch saturation attempts.
% 0.18/0.41 # There were 0 free duplicated saturations.
% 0.18/0.41 # There were 2 total successful branch saturations.
% 0.18/0.41 # There were 0 successful branch saturations in interreduction.
% 0.18/0.41 # There were 0 successful branch saturations on the branch.
% 0.18/0.41 # There were 2 successful branch saturations after the branch.
% 0.18/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.41 # Begin clausification derivation
% 0.18/0.41
% 0.18/0.41 # End clausification derivation
% 0.18/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.41 cnf(i_0_95, negated_conjecture, (holdsAt(forwards,n2))).
% 0.18/0.41 cnf(i_0_62, plain, (plus(n2,n2)=n4)).
% 0.18/0.41 cnf(i_0_60, plain, (plus(n1,n2)=n3)).
% 0.18/0.41 cnf(i_0_63, plain, (plus(n2,n3)=n5)).
% 0.18/0.41 cnf(i_0_55, plain, (plus(n0,n0)=n0)).
% 0.18/0.41 cnf(i_0_59, plain, (plus(n1,n1)=n2)).
% 0.18/0.41 cnf(i_0_58, plain, (plus(n0,n3)=n3)).
% 0.18/0.41 cnf(i_0_61, plain, (plus(n1,n3)=n4)).
% 0.18/0.41 cnf(i_0_64, plain, (plus(n3,n3)=n6)).
% 0.18/0.41 cnf(i_0_31, plain, (happens(push,n2))).
% 0.18/0.41 cnf(i_0_32, plain, (happens(pull,n2))).
% 0.18/0.41 cnf(i_0_57, plain, (plus(n2,n0)=n2)).
% 0.18/0.41 cnf(i_0_66, plain, (less_or_equal(X1,X1))).
% 0.18/0.41 cnf(i_0_34, plain, (happens(push,n0))).
% 0.18/0.41 cnf(i_0_33, plain, (happens(pull,n1))).
% 0.18/0.41 cnf(i_0_127, plain, (epred2_3(X1,pull,forwards))).
% 0.18/0.41 cnf(i_0_56, plain, (plus(n1,n0)=n1)).
% 0.18/0.41 cnf(i_0_65, plain, (plus(X1,X2)=plus(X2,X1))).
% 0.18/0.41 cnf(i_0_52, plain, (forwards!=backwards)).
% 0.18/0.41 cnf(i_0_53, plain, (spinning!=forwards)).
% 0.18/0.41 cnf(i_0_91, hypothesis, (~holdsAt(forwards,n0))).
% 0.18/0.41 cnf(i_0_51, plain, (push!=pull)).
% 0.18/0.41 cnf(i_0_54, plain, (spinning!=backwards)).
% 0.18/0.41 cnf(i_0_94, hypothesis, (~releasedAt(X1,X2))).
% 0.18/0.41 cnf(i_0_69, plain, (~less(X1,n0))).
% 0.18/0.41 cnf(i_0_92, hypothesis, (~holdsAt(backwards,n0))).
% 0.18/0.41 cnf(i_0_93, hypothesis, (~holdsAt(spinning,n0))).
% 0.18/0.41 cnf(i_0_30, plain, (~releases(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_89, plain, (~less(X1,X1))).
% 0.18/0.41 cnf(i_0_90, plain, (~less(X1,X2)|~less(X2,X1))).
% 0.18/0.41 cnf(i_0_70, plain, (less(X1,n1)|~less_or_equal(X1,n0))).
% 0.18/0.41 cnf(i_0_72, plain, (less(X1,n2)|~less_or_equal(X1,n1))).
% 0.18/0.41 cnf(i_0_74, plain, (less(X1,n3)|~less_or_equal(X1,n2))).
% 0.18/0.41 cnf(i_0_75, plain, (less_or_equal(X1,n2)|~less(X1,n3))).
% 0.18/0.41 cnf(i_0_73, plain, (less_or_equal(X1,n1)|~less(X1,n2))).
% 0.18/0.41 cnf(i_0_76, plain, (less(X1,n4)|~less_or_equal(X1,n3))).
% 0.18/0.41 cnf(i_0_78, plain, (less(X1,n5)|~less_or_equal(X1,n4))).
% 0.18/0.41 cnf(i_0_80, plain, (less(X1,n6)|~less_or_equal(X1,n5))).
% 0.18/0.41 cnf(i_0_82, plain, (less(X1,n7)|~less_or_equal(X1,n6))).
% 0.18/0.41 cnf(i_0_84, plain, (less(X1,n8)|~less_or_equal(X1,n7))).
% 0.18/0.41 cnf(i_0_86, plain, (less(X1,n9)|~less_or_equal(X1,n8))).
% 0.18/0.41 cnf(i_0_71, plain, (less_or_equal(X1,n0)|~less(X1,n1))).
% 0.18/0.41 cnf(i_0_77, plain, (less_or_equal(X1,n3)|~less(X1,n4))).
% 0.18/0.41 cnf(i_0_79, plain, (less_or_equal(X1,n4)|~less(X1,n5))).
% 0.18/0.41 cnf(i_0_81, plain, (less_or_equal(X1,n5)|~less(X1,n6))).
% 0.18/0.41 cnf(i_0_67, plain, (less_or_equal(X1,X2)|~less(X1,X2))).
% 0.18/0.41 cnf(i_0_27, plain, (epred1_3(X1,X2,X3)|~initiates(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_29, plain, (epred3_3(X1,X2,X3)|~terminates(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_83, plain, (less_or_equal(X1,n6)|~less(X1,n7))).
% 0.18/0.41 cnf(i_0_85, plain, (less_or_equal(X1,n7)|~less(X1,n8))).
% 0.18/0.41 cnf(i_0_87, plain, (less_or_equal(X1,n8)|~less(X1,n9))).
% 0.18/0.41 cnf(i_0_50, plain, (X1=pull|X1=push|~happens(X1,X2))).
% 0.18/0.41 cnf(i_0_133, plain, (X1=forwards|~epred2_3(X2,X3,X1)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_107, plain, (X1=pull|~epred1_3(X2,X1,X3)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_137, plain, (X1=pull|~epred2_3(X2,X1,X3)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_68, plain, (X1=X2|less(X1,X2)|~less_or_equal(X1,X2))).
% 0.18/0.41 cnf(i_0_151, plain, (X1=forwards|X2=push|~epred2_3(X3,X2,X1))).
% 0.18/0.41 cnf(i_0_116, plain, (X1=pull|X2=forwards|~epred1_3(X3,X1,X2))).
% 0.18/0.41 cnf(i_0_142, plain, (X1=backwards|X1=forwards|~epred2_3(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_146, plain, (X1=pull|X2=backwards|~epred2_3(X3,X1,X2))).
% 0.18/0.41 cnf(i_0_125, plain, (X1=pull|X1=push|~epred1_3(X2,X1,X3))).
% 0.18/0.41 cnf(i_0_44, plain, (X1=push|X2=n2|X2=n1|~happens(X1,X2))).
% 0.18/0.41 cnf(i_0_28, plain, (terminates(X1,X2,X3)|~epred3_3(X3,X1,X2))).
% 0.18/0.41 cnf(i_0_26, plain, (initiates(X1,X2,X3)|~epred1_3(X3,X1,X2))).
% 0.18/0.41 cnf(i_0_159, plain, (epred3_3(X1,X2,X3)|~epred2_3(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_155, plain, (X1=pull|X1=push|~epred2_3(X2,X1,X3))).
% 0.18/0.41 cnf(i_0_39, plain, (X1=n2|X1=n0|X2=pull|~happens(X2,X1))).
% 0.18/0.41 cnf(i_0_22, plain, (~holdsAt(X1,plus(X2,n1))|~terminates(X3,X1,X2)|~happens(X3,X2))).
% 0.18/0.41 cnf(i_0_35, plain, (X1=n2|X1=n1|X1=n0|~happens(X2,X1))).
% 0.18/0.41 cnf(i_0_88, plain, (X1=X2|less(X1,X2)|less(X2,X1))).
% 0.18/0.41 cnf(i_0_100, plain, (X1=spinning|~epred1_3(X2,X3,X1)|~happens(push,X2)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_112, plain, (X1=spinning|X1=backwards|X1=forwards|~epred1_3(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_118, plain, (X1=spinning|X2=push|~epred1_3(X3,X2,X1)|~happens(push,X3))).
% 0.18/0.41 cnf(i_0_109, plain, (X1=spinning|X1=forwards|~epred1_3(X2,X3,X1)|~happens(push,X2))).
% 0.18/0.41 cnf(i_0_121, plain, (X1=spinning|X1=backwards|X2=push|~epred1_3(X3,X2,X1))).
% 0.18/0.41 cnf(i_0_103, plain, (X1=spinning|X1=backwards|~epred1_3(X2,X3,X1)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_111, plain, (X1=backwards|X1=forwards|happens(push,X2)|~epred1_3(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_120, plain, (X1=backwards|X2=push|happens(push,X3)|~epred1_3(X3,X2,X1))).
% 0.18/0.41 cnf(i_0_102, plain, (X1=backwards|happens(push,X2)|~epred1_3(X2,X3,X1)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_4, plain, (less(X1,esk2_3(X1,X2,X3))|~stoppedIn(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_9, plain, (less(X1,esk4_3(X1,X2,X3))|~startedIn(X1,X3,X2))).
% 0.18/0.41 cnf(i_0_3, plain, (less(esk2_3(X1,X2,X3),X3)|~stoppedIn(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_8, plain, (less(esk4_3(X1,X2,X3),X2)|~startedIn(X1,X3,X2))).
% 0.18/0.41 cnf(i_0_182, plain, (X1=spinning|X2=pull|epred2_3(X3,X2,X1)|~epred3_3(X3,X2,X1))).
% 0.18/0.41 cnf(i_0_180, plain, (X1=pull|~epred3_3(X2,X1,X3)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_186, plain, (X1=pull|X1=push|~epred3_3(X2,X1,X3))).
% 0.18/0.41 cnf(i_0_173, plain, (X1=spinning|X1=backwards|epred2_3(X2,X3,X1)|~epred3_3(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_21, plain, (holdsAt(X1,plus(X2,n1))|~initiates(X3,X1,X2)|~happens(X3,X2))).
% 0.18/0.41 cnf(i_0_164, plain, (X1=spinning|epred2_3(X2,X3,X1)|happens(push,X2)|~epred3_3(X2,X3,X1))).
% 0.18/0.41 cnf(i_0_14, plain, (holdsAt(X1,plus(X2,n1))|happens(esk5_2(X1,X2),X2)|~holdsAt(X1,X2))).
% 0.18/0.41 cnf(i_0_169, plain, (X1=backwards|epred2_3(X2,X3,X1)|~epred3_3(X2,X3,X1)|~happens(push,X2)|~happens(pull,X2))).
% 0.18/0.41 cnf(i_0_175, plain, (X1=push|X2=backwards|epred2_3(X3,X1,X2)|~epred3_3(X3,X1,X2)|~happens(push,X3))).
% 0.18/0.41 cnf(i_0_16, plain, (holdsAt(X1,X2)|happens(esk6_2(X1,X2),X2)|~holdsAt(X1,plus(X2,n1)))).
% 0.18/0.41 cnf(i_0_1, plain, (stoppedIn(X1,X2,X3)|~terminates(X4,X2,X5)|~less(X1,X5)|~less(X5,X3)|~happens(X4,X5))).
% 0.18/0.41 cnf(i_0_5, plain, (happens(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))|~stoppedIn(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_10, plain, (happens(esk3_3(X1,X2,X3),esk4_3(X1,X2,X3))|~startedIn(X1,X3,X2))).
% 0.18/0.41 cnf(i_0_2, plain, (terminates(esk1_3(X1,X2,X3),X2,esk2_3(X1,X2,X3))|~stoppedIn(X1,X2,X3))).
% 0.18/0.41 cnf(i_0_13, plain, (holdsAt(X1,plus(X2,n1))|terminates(esk5_2(X1,X2),X1,X2)|~holdsAt(X1,X2))).
% 0.18/0.41 cnf(i_0_7, plain, (initiates(esk3_3(X1,X2,X3),X3,esk4_3(X1,X2,X3))|~startedIn(X1,X3,X2))).
% 0.18/0.41 cnf(i_0_6, plain, (startedIn(X1,X2,X3)|~initiates(X4,X2,X5)|~less(X1,X5)|~less(X5,X3)|~happens(X4,X5))).
% 0.18/0.41 cnf(i_0_15, plain, (holdsAt(X1,X2)|initiates(esk6_2(X1,X2),X1,X2)|~holdsAt(X1,plus(X2,n1)))).
% 0.18/0.41 cnf(i_0_11, 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.18/0.41 cnf(i_0_12, 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.18/0.41 cnf(i_0_96, plain, (epred1_3(X1,pull,spinning)|~happens(push,X1))).
% 0.18/0.41 cnf(i_0_158, plain, (epred3_3(X1,pull,backwards)|~happens(push,X1))).
% 0.18/0.41 cnf(i_0_98, plain, (epred1_3(X1,push,forwards)|happens(pull,X1))).
% 0.18/0.41 cnf(i_0_97, plain, (epred1_3(X1,pull,backwards)|happens(push,X1))).
% 0.18/0.41 cnf(i_0_156, plain, (epred3_3(X1,pull,spinning)|happens(push,X1))).
% 0.18/0.41 cnf(i_0_128, plain, (epred2_3(X1,push,backwards)|happens(pull,X1))).
% 0.18/0.41 cnf(i_0_157, plain, (epred3_3(X1,push,spinning)|happens(pull,X1))).
% 0.18/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.41 # Begin printing tableau
% 0.18/0.41 # Found 6 steps
% 0.18/0.41 cnf(i_0_95, negated_conjecture, (holdsAt(forwards,n2)), inference(start_rule)).
% 0.18/0.41 cnf(i_0_215, plain, (holdsAt(forwards,n2)), inference(extension_rule, [i_0_13])).
% 0.18/0.41 cnf(i_0_409, plain, (holdsAt(forwards,plus(n2,n1))), inference(extension_rule, [i_0_22])).
% 0.18/0.41 cnf(i_0_541, plain, (~happens(push,n2)), inference(closure_rule, [i_0_31])).
% 0.18/0.41 cnf(i_0_410, plain, (terminates(esk5_2(forwards,n2),forwards,n2)), inference(etableau_closure_rule, [i_0_410, ...])).
% 0.18/0.41 cnf(i_0_540, plain, (~terminates(push,forwards,n2)), inference(etableau_closure_rule, [i_0_540, ...])).
% 0.18/0.41 # End printing tableau
% 0.18/0.41 # SZS output end
% 0.18/0.41 # Branches closed with saturation will be marked with an "s"
% 0.18/0.41 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.41 # We now have 2 tableaux to operate on
% 0.18/0.41 # Found closed tableau during pool population.
% 0.18/0.41 # Proof search is over...
% 0.18/0.41 # Freeing feature tree
%------------------------------------------------------------------------------