TSTP Solution File: CSR024+1.010 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR024+1.010 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 23:21:10 EDT 2022
% Result : Theorem 31.61s 31.89s
% Output : Refutation 31.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : CSR024+1.010 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.02/0.08 % Command : sos-script %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Sat Jun 11 18:52:40 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.08/0.30 ----- Otter 3.2, August 2001 -----
% 0.08/0.30 The process was started by sandbox2 on n032.cluster.edu,
% 0.08/0.30 Sat Jun 11 18:52:40 2022
% 0.08/0.30 The command was "./sos". The process ID is 17705.
% 0.08/0.30
% 0.08/0.30 set(prolog_style_variables).
% 0.08/0.30 set(auto).
% 0.08/0.30 dependent: set(auto1).
% 0.08/0.30 dependent: set(process_input).
% 0.08/0.30 dependent: clear(print_kept).
% 0.08/0.30 dependent: clear(print_new_demod).
% 0.08/0.30 dependent: clear(print_back_demod).
% 0.08/0.30 dependent: clear(print_back_sub).
% 0.08/0.30 dependent: set(control_memory).
% 0.08/0.30 dependent: assign(max_mem, 12000).
% 0.08/0.30 dependent: assign(pick_given_ratio, 4).
% 0.08/0.30 dependent: assign(stats_level, 1).
% 0.08/0.30 dependent: assign(pick_semantic_ratio, 3).
% 0.08/0.30 dependent: assign(sos_limit, 5000).
% 0.08/0.30 dependent: assign(max_weight, 60).
% 0.08/0.30 clear(print_given).
% 0.08/0.30
% 0.08/0.30 formula_list(usable).
% 0.08/0.30
% 0.08/0.30 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=21.
% 0.08/0.30
% 0.08/0.30 This ia a non-Horn set with equality. The strategy will be
% 0.08/0.30 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.08/0.30 unit deletion, with positive clauses in sos and nonpositive
% 0.08/0.30 clauses in usable.
% 0.08/0.30
% 0.08/0.30 dependent: set(knuth_bendix).
% 0.08/0.30 dependent: set(para_from).
% 0.08/0.30 dependent: set(para_into).
% 0.08/0.30 dependent: clear(para_from_right).
% 0.08/0.30 dependent: clear(para_into_right).
% 0.08/0.30 dependent: set(para_from_vars).
% 0.08/0.30 dependent: set(eq_units_both_ways).
% 0.08/0.30 dependent: set(dynamic_demod_all).
% 0.08/0.30 dependent: set(dynamic_demod).
% 0.08/0.30 dependent: set(order_eq).
% 0.08/0.30 dependent: set(back_demod).
% 0.08/0.30 dependent: set(lrpo).
% 0.08/0.30 dependent: set(hyper_res).
% 0.08/0.30 dependent: set(unit_deletion).
% 0.08/0.30 dependent: set(factor).
% 0.08/0.30
% 0.08/0.30 ------------> process usable:
% 0.08/0.30 75 back subsumes 23.
% 0.08/0.30 159 back subsumes 25.
% 0.08/0.30 159 back subsumes 24.
% 0.08/0.30 159 back subsumes 20.
% 0.08/0.30 159 back subsumes 19.
% 0.08/0.30 159 back subsumes 18.
% 0.08/0.30 159 back subsumes 17.
% 0.08/0.30
% 0.08/0.30 ------------> process sos:
% 0.08/0.30 Following clause subsumed by 348 during input processing: 0 [copy,348,flip.1] {-} plus(A,B)=plus(B,A).
% 0.08/0.30 Following clause subsumed by 350 during input processing: 0 [copy,350,flip.1] {-} A=A.
% 0.08/0.30
% 0.08/0.30 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Failed to model usable list: disabling FINDER
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 225
% 0.12/0.40 number of clauses initially in problem: 248
% 0.12/0.40 percentage of clauses intially in UL: 90
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40 percent of all initial clauses that are short: 99
% 0.12/0.40 absolute distinct symbol count: 59
% 0.12/0.40 distinct predicate count: 13
% 0.12/0.40 distinct function count: 16
% 0.12/0.40 distinct constant count: 30
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 4.73/4.92
% 4.73/4.92
% 4.73/4.92 Changing weight limit from 60 to 50.
% 4.73/4.92
% 4.73/4.92 Resetting weight limit to 50 after 85 givens.
% 4.73/4.92
% 6.67/6.85
% 6.67/6.85
% 6.67/6.85 Changing weight limit from 50 to 42.
% 6.67/6.85
% 6.67/6.85 Resetting weight limit to 42 after 90 givens.
% 6.67/6.85
% 6.85/7.04
% 6.85/7.04
% 6.85/7.04 Changing weight limit from 42 to 41.
% 6.85/7.04
% 6.85/7.04 Resetting weight limit to 41 after 95 givens.
% 6.85/7.04
% 7.13/7.32
% 7.13/7.32
% 7.13/7.32 Changing weight limit from 41 to 38.
% 7.13/7.32
% 7.13/7.32 Resetting weight limit to 38 after 100 givens.
% 7.13/7.32
% 8.51/8.73
% 8.51/8.73
% 8.51/8.73 Changing weight limit from 38 to 26.
% 8.51/8.73
% 8.51/8.73 Resetting weight limit to 26 after 105 givens.
% 8.51/8.73
% 9.37/9.60
% 9.37/9.60
% 9.37/9.60 Changing weight limit from 26 to 23.
% 9.37/9.60
% 9.37/9.60 Resetting weight limit to 23 after 110 givens.
% 9.37/9.60
% 10.00/10.25
% 10.00/10.25
% 10.00/10.25 Changing weight limit from 23 to 19.
% 10.00/10.25
% 10.00/10.25 Resetting weight limit to 19 after 115 givens.
% 10.00/10.25
% 10.42/10.74
% 10.42/10.74
% 10.42/10.74 Changing weight limit from 19 to 17.
% 10.42/10.74
% 10.42/10.74 Resetting weight limit to 17 after 120 givens.
% 10.42/10.74
% 10.66/10.94
% 10.66/10.94
% 10.66/10.94 Changing weight limit from 17 to 16.
% 10.66/10.94
% 10.66/10.94 Resetting weight limit to 16 after 125 givens.
% 10.66/10.94
% 11.42/11.68
% 11.42/11.68
% 11.42/11.68 Changing weight limit from 16 to 15.
% 11.42/11.68
% 11.42/11.68 Resetting weight limit to 15 after 135 givens.
% 11.42/11.68
% 13.70/13.98
% 13.70/13.98
% 13.70/13.98 Changing weight limit from 15 to 14.
% 13.70/13.98
% 13.70/13.98 Resetting weight limit to 14 after 160 givens.
% 13.70/13.98
% 14.85/15.16
% 14.85/15.16
% 14.85/15.16 Changing weight limit from 14 to 13.
% 14.85/15.16
% 14.85/15.16 Resetting weight limit to 13 after 200 givens.
% 14.85/15.16
% 25.14/25.42
% 25.14/25.42
% 25.14/25.42 Changing weight limit from 13 to 12.
% 25.14/25.42
% 25.14/25.42 Modelling stopped after 300 given clauses and 0.00 seconds
% 25.14/25.42
% 25.14/25.42
% 25.14/25.42 Resetting weight limit to 12 after 445 givens.
% 25.14/25.42
% 26.91/27.23
% 26.91/27.23
% 26.91/27.23 Changing weight limit from 12 to 11.
% 26.91/27.23
% 26.91/27.23 Resetting weight limit to 11 after 640 givens.
% 26.91/27.23
% 27.43/27.75
% 27.43/27.75
% 27.43/27.75 Changing weight limit from 11 to 10.
% 27.43/27.75
% 27.43/27.75 Resetting weight limit to 10 after 675 givens.
% 27.43/27.75
% 31.61/31.89
% 31.61/31.89 -- HEY sandbox2, WE HAVE A PROOF!! --
% 31.61/31.89
% 31.61/31.89 -----> EMPTY CLAUSE at 31.33 sec ----> 31753 [hyper,31738,324,31682,31626,31570,31514,31458,31402,31346,31290,31234] {-} $F.
% 31.61/31.89
% 31.61/31.89 Length of proof is 41. Level of proof is 3.
% 31.61/31.89
% 31.61/31.89 ---------------- PROOF ----------------
% 31.61/31.89 % SZS status Theorem
% 31.61/31.89 % SZS output start Refutation
% 31.61/31.89
% 31.61/31.89 21 [] {+} -happens(A,B)| -initiates(A,C,B)|holdsAt(C,plus(B,n1)).
% 31.61/31.89 52 [] {+} initiates(A,B,C)|A!=pull(D,E)|B!=spinning(E)| -happens(push(D,E),C).
% 31.61/31.89 109 [] {+} happens(A,B)|A!=pull(agent1,trolley1)|B!=n0.
% 31.61/31.89 110 [] {+} happens(A,B)|A!=push(agent1,trolley1)|B!=n0.
% 31.61/31.89 111 [] {+} happens(A,B)|A!=pull(agent2,trolley2)|B!=n0.
% 31.61/31.89 112 [] {+} happens(A,B)|A!=push(agent2,trolley2)|B!=n0.
% 31.61/31.89 113 [] {+} happens(A,B)|A!=pull(agent3,trolley3)|B!=n0.
% 31.61/31.89 114 [] {+} happens(A,B)|A!=push(agent3,trolley3)|B!=n0.
% 31.61/31.89 115 [] {+} happens(A,B)|A!=pull(agent4,trolley4)|B!=n0.
% 31.61/31.89 116 [] {+} happens(A,B)|A!=push(agent4,trolley4)|B!=n0.
% 31.61/31.89 117 [] {+} happens(A,B)|A!=pull(agent5,trolley5)|B!=n0.
% 31.61/31.89 118 [] {+} happens(A,B)|A!=push(agent5,trolley5)|B!=n0.
% 31.61/31.89 119 [] {+} happens(A,B)|A!=pull(agent6,trolley6)|B!=n0.
% 31.61/31.89 120 [] {+} happens(A,B)|A!=push(agent6,trolley6)|B!=n0.
% 31.61/31.89 121 [] {+} happens(A,B)|A!=pull(agent7,trolley7)|B!=n0.
% 31.61/31.89 122 [] {+} happens(A,B)|A!=push(agent7,trolley7)|B!=n0.
% 31.61/31.89 123 [] {+} happens(A,B)|A!=pull(agent8,trolley8)|B!=n0.
% 31.61/31.89 124 [] {+} happens(A,B)|A!=push(agent8,trolley8)|B!=n0.
% 31.61/31.89 125 [] {+} happens(A,B)|A!=pull(agent9,trolley9)|B!=n0.
% 31.61/31.89 126 [] {+} happens(A,B)|A!=push(agent9,trolley9)|B!=n0.
% 31.61/31.89 127 [] {+} happens(A,B)|A!=pull(agent10,trolley10)|B!=n0.
% 31.61/31.89 128 [] {+} happens(A,B)|A!=push(agent10,trolley10)|B!=n0.
% 31.61/31.89 324 [] {+} -holdsAt(spinning(trolley1),n1)| -holdsAt(spinning(trolley2),n1)| -holdsAt(spinning(trolley3),n1)| -holdsAt(spinning(trolley4),n1)| -holdsAt(spinning(trolley5),n1)| -holdsAt(spinning(trolley6),n1)| -holdsAt(spinning(trolley7),n1)| -holdsAt(spinning(trolley8),n1)| -holdsAt(spinning(trolley9),n1)| -holdsAt(spinning(trolley10),n1).
% 31.61/31.89 330 [] {-} plus(n0,n1)=n1.
% 31.61/31.89 350 [] {-} A=A.
% 31.61/31.89 385 [hyper,350,128,350] {-} happens(push(agent10,trolley10),n0).
% 31.61/31.89 386 [hyper,350,127,350] {-} happens(pull(agent10,trolley10),n0).
% 31.61/31.89 387 [hyper,350,126,350] {-} happens(push(agent9,trolley9),n0).
% 31.61/31.89 388 [hyper,350,125,350] {-} happens(pull(agent9,trolley9),n0).
% 31.61/31.89 389 [hyper,350,124,350] {-} happens(push(agent8,trolley8),n0).
% 31.61/31.89 390 [hyper,350,123,350] {-} happens(pull(agent8,trolley8),n0).
% 31.61/31.89 391 [hyper,350,122,350] {-} happens(push(agent7,trolley7),n0).
% 31.61/31.89 392 [hyper,350,121,350] {-} happens(pull(agent7,trolley7),n0).
% 31.61/31.89 393 [hyper,350,120,350] {-} happens(push(agent6,trolley6),n0).
% 31.61/31.89 394 [hyper,350,119,350] {-} happens(pull(agent6,trolley6),n0).
% 31.61/31.89 395 [hyper,350,118,350] {-} happens(push(agent5,trolley5),n0).
% 31.61/31.89 396 [hyper,350,117,350] {-} happens(pull(agent5,trolley5),n0).
% 31.61/31.89 397 [hyper,350,116,350] {-} happens(push(agent4,trolley4),n0).
% 31.61/31.89 398 [hyper,350,115,350] {-} happens(pull(agent4,trolley4),n0).
% 31.61/31.89 399 [hyper,350,114,350] {-} happens(push(agent3,trolley3),n0).
% 31.61/31.89 400 [hyper,350,113,350] {-} happens(pull(agent3,trolley3),n0).
% 31.61/31.89 401 [hyper,350,112,350] {-} happens(push(agent2,trolley2),n0).
% 31.61/31.89 402 [hyper,350,111,350] {-} happens(pull(agent2,trolley2),n0).
% 31.61/31.89 403 [hyper,350,110,350] {-} happens(push(agent1,trolley1),n0).
% 31.61/31.89 404 [hyper,350,109,350] {-} happens(pull(agent1,trolley1),n0).
% 31.61/31.89 489 [para_from,330.1.1,21.3.2] {-} -happens(A,n0)| -initiates(A,B,n0)|holdsAt(B,n1).
% 31.61/31.89 11817 [hyper,385,52,350,350] {-} initiates(pull(agent10,trolley10),spinning(trolley10),n0).
% 31.61/31.89 12521 [hyper,387,52,350,350] {-} initiates(pull(agent9,trolley9),spinning(trolley9),n0).
% 31.61/31.89 12646 [hyper,389,52,350,350] {-} initiates(pull(agent8,trolley8),spinning(trolley8),n0).
% 31.61/31.89 13391 [hyper,391,52,350,350] {-} initiates(pull(agent7,trolley7),spinning(trolley7),n0).
% 31.61/31.89 13530 [hyper,393,52,350,350] {-} initiates(pull(agent6,trolley6),spinning(trolley6),n0).
% 31.61/31.89 13671 [hyper,395,52,350,350] {-} initiates(pull(agent5,trolley5),spinning(trolley5),n0).
% 31.61/31.89 13810 [hyper,397,52,350,350] {-} initiates(pull(agent4,trolley4),spinning(trolley4),n0).
% 31.61/31.89 13951 [hyper,399,52,350,350] {-} initiates(pull(agent3,trolley3),spinning(trolley3),n0).
% 31.61/31.89 14090 [hyper,401,52,350,350] {-} initiates(pull(agent2,trolley2),spinning(trolley2),n0).
% 31.61/31.89 14187 [hyper,403,52,350,350] {-} initiates(pull(agent1,trolley1),spinning(trolley1),n0).
% 31.61/31.89 31234 [hyper,11817,489,386] {-} holdsAt(spinning(trolley10),n1).
% 31.61/31.89 31290 [hyper,12521,489,388] {-} holdsAt(spinning(trolley9),n1).
% 31.61/31.89 31346 [hyper,12646,489,390] {-} holdsAt(spinning(trolley8),n1).
% 31.61/31.89 31402 [hyper,13391,489,392] {-} holdsAt(spinning(trolley7),n1).
% 31.61/31.89 31458 [hyper,13530,489,394] {-} holdsAt(spinning(trolley6),n1).
% 31.61/31.89 31514 [hyper,13671,489,396] {-} holdsAt(spinning(trolley5),n1).
% 31.61/31.89 31570 [hyper,13810,489,398] {-} holdsAt(spinning(trolley4),n1).
% 31.61/31.89 31626 [hyper,13951,489,400] {-} holdsAt(spinning(trolley3),n1).
% 31.61/31.89 31682 [hyper,14090,489,402] {-} holdsAt(spinning(trolley2),n1).
% 31.61/31.89 31738 [hyper,14187,489,404] {-} holdsAt(spinning(trolley1),n1).
% 31.61/31.89 31753 [hyper,31738,324,31682,31626,31570,31514,31458,31402,31346,31290,31234] {-} $F.
% 31.61/31.89
% 31.61/31.89 % SZS output end Refutation
% 31.61/31.89 ------------ end of proof -------------
% 31.61/31.89
% 31.61/31.89
% 31.61/31.89 Search stopped by max_proofs option.
% 31.61/31.89
% 31.61/31.89
% 31.61/31.89 Search stopped by max_proofs option.
% 31.61/31.89
% 31.61/31.89 ============ end of search ============
% 31.61/31.89
% 31.61/31.89 That finishes the proof of the theorem.
% 31.61/31.89
% 31.61/31.89 Process 17705 finished Sat Jun 11 18:53:11 2022
%------------------------------------------------------------------------------