TSTP Solution File: LCL024-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL024-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %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 : Sun Jul 17 14:27:25 EDT 2022
% Result : Unsatisfiable 14.90s 15.13s
% Output : Refutation 14.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL024-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 12:44:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n029.cluster.edu,
% 0.19/0.36 Mon Jul 4 12:44:11 2022
% 0.19/0.36 The command was "./sos". The process ID is 15621.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a Horn set without equality. The strategy will
% 0.19/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.36 in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: clear(order_hyper).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 2
% 0.19/0.38 number of clauses initially in problem: 3
% 0.19/0.38 percentage of clauses intially in UL: 66
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 5
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 3
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 12.13/12.33
% 12.13/12.33
% 12.13/12.33 Changing weight limit from 60 to 48.
% 12.13/12.33
% 12.13/12.33 Model 2 (0.00 seconds, 0 Inserts)
% 12.13/12.33
% 12.13/12.33 Stopped by limit on number of solutions
% 12.13/12.33
% 12.13/12.33 Model 3 (0.00 seconds, 0 Inserts)
% 12.13/12.33
% 12.13/12.33 Stopped by limit on number of solutions
% 12.13/12.33
% 12.13/12.33 Model 4 (0.00 seconds, 0 Inserts)
% 12.13/12.33
% 12.13/12.33 Stopped by limit on number of solutions
% 12.13/12.33
% 12.13/12.33 Model 5 (0.00 seconds, 0 Inserts)
% 12.13/12.33
% 12.13/12.33 Stopped by limit on number of solutions
% 12.13/12.33
% 12.13/12.33 Model 6 (0.00 seconds, 0 Inserts)
% 12.13/12.33
% 12.13/12.33 Stopped by limit on number of solutions
% 12.13/12.33
% 12.13/12.33 Model 7 (0.00 seconds, 0 Inserts)
% 12.13/12.33
% 12.13/12.33 Stopped by limit on number of solutions
% 12.13/12.33
% 12.13/12.33 Resetting weight limit to 48 after 95 givens.
% 12.13/12.33
% 12.33/12.52
% 12.33/12.52
% 12.33/12.52 Changing weight limit from 48 to 40.
% 12.33/12.52
% 12.33/12.52 Resetting weight limit to 40 after 100 givens.
% 12.33/12.52
% 12.54/12.78
% 12.54/12.78
% 12.54/12.78 Changing weight limit from 40 to 36.
% 12.54/12.78
% 12.54/12.78 Resetting weight limit to 36 after 105 givens.
% 12.54/12.78
% 12.73/12.92
% 12.73/12.92
% 12.73/12.92 Changing weight limit from 36 to 32.
% 12.73/12.92
% 12.73/12.92 Resetting weight limit to 32 after 110 givens.
% 12.73/12.92
% 12.93/13.13
% 12.93/13.13
% 12.93/13.13 Changing weight limit from 32 to 28.
% 12.93/13.13
% 12.93/13.13 Resetting weight limit to 28 after 120 givens.
% 12.93/13.13
% 14.38/14.58
% 14.38/14.58
% 14.38/14.58 Changing weight limit from 28 to 24.
% 14.38/14.58
% 14.38/14.58 Resetting weight limit to 24 after 210 givens.
% 14.38/14.58
% 14.90/15.13
% 14.90/15.13 -- HEY sandbox2, WE HAVE A PROOF!! --
% 14.90/15.13
% 14.90/15.13 ----> UNIT CONFLICT at 14.71 sec ----> 15638 [binary,15637.1,2.1] {-} $F.
% 14.90/15.13
% 14.90/15.13 Length of proof is 16. Level of proof is 11.
% 14.90/15.13
% 14.90/15.13 ---------------- PROOF ----------------
% 14.90/15.13 % SZS status Unsatisfiable
% 14.90/15.13 % SZS output start Refutation
% 14.90/15.13
% 14.90/15.13 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 14.90/15.13 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))).
% 14.90/15.13 3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,A)),equivalent(C,B)))).
% 14.90/15.13 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(D,equivalent(E,C)),equivalent(E,D))))),equivalent(B,A))).
% 14.90/15.13 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(C,D)),D)).
% 14.90/15.13 8 [hyper,7,1,7] {+} is_a_theorem(equivalent(A,A)).
% 14.90/15.13 11 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,A)),equivalent(C,B))),equivalent(D,D))).
% 14.90/15.13 13 [hyper,8,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(B,A))).
% 14.90/15.13 17 [hyper,13,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,equivalent(E,E))),equivalent(D,C)))),equivalent(B,A))).
% 14.90/15.13 19 [hyper,13,1,7] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(C,B)),equivalent(D,equivalent(A,equivalent(E,E)))))).
% 14.90/15.13 21 [hyper,13,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 14.90/15.13 42 [hyper,21,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(C,D)),D))),equivalent(B,A))).
% 14.90/15.13 123 [hyper,11,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(equivalent(D,equivalent(E,C)),equivalent(E,D))),equivalent(F,F)))),equivalent(B,A))).
% 14.90/15.13 611 [hyper,19,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(D,equivalent(D,C)))).
% 14.90/15.13 2454 [hyper,611,1,42] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(equivalent(C,equivalent(D,B)),equivalent(D,C)))).
% 14.90/15.13 4188 [hyper,2454,1,13] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(C,equivalent(C,B)))).
% 14.90/15.13 10380 [hyper,4188,1,17] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(D,equivalent(D,equivalent(B,A))))).
% 14.90/15.13 10530 [hyper,10380,1,4] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,equivalent(B,A)),equivalent(D,D))))).
% 14.90/15.13 15637 [hyper,123,1,10530] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(B,A))).
% 14.90/15.13 15638 [binary,15637.1,2.1] {-} $F.
% 14.90/15.13
% 14.90/15.13 % SZS output end Refutation
% 14.90/15.13 ------------ end of proof -------------
% 14.90/15.13
% 14.90/15.13
% 14.90/15.13 Search stopped by max_proofs option.
% 14.90/15.13
% 14.90/15.13
% 14.90/15.13 Search stopped by max_proofs option.
% 14.90/15.13
% 14.90/15.13 ============ end of search ============
% 14.90/15.13
% 14.90/15.13 ----------- soft-scott stats ----------
% 14.90/15.13
% 14.90/15.13 true clauses given 65 (24.9%)
% 14.90/15.13 false clauses given 196
% 14.90/15.13
% 14.90/15.13 FALSE TRUE
% 14.90/15.13 12 0 17
% 14.90/15.13 16 0 356
% 14.90/15.13 20 807 1416
% 14.90/15.13 24 1738 734
% 14.90/15.13 tot: 2545 2523 (49.8% true)
% 14.90/15.13
% 14.90/15.13
% 14.90/15.13 Model 7 (0.00 seconds, 0 Inserts)
% 14.90/15.13
% 14.90/15.13 That finishes the proof of the theorem.
% 14.90/15.13
% 14.90/15.13 Process 15621 finished Mon Jul 4 12:44:26 2022
%------------------------------------------------------------------------------