TSTP Solution File: LCL122-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL122-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:28:04 EDT 2022
% Result : Unsatisfiable 136.36s 136.54s
% Output : Refutation 136.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL122-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 05:49:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.13/0.35 Mon Jul 4 05:49:04 2022
% 0.13/0.35 The command was "./sos". The process ID is 22736.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 3
% 0.13/0.38 percentage of clauses intially in UL: 66
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 7
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 1
% 0.13/0.38 distinct constant count: 5
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 6.46/6.65
% 6.46/6.65
% 6.46/6.65 Changing weight limit from 60 to 44.
% 6.46/6.65
% 6.46/6.65 Model 2 (0.00 seconds, 0 Inserts)
% 6.46/6.65
% 6.46/6.65 Stopped by limit on number of solutions
% 6.46/6.65
% 6.46/6.65 Stopped by limit on insertions
% 6.46/6.65
% 6.46/6.65 Model 3 (0.00 seconds, 0 Inserts)
% 6.46/6.65
% 6.46/6.65 Stopped by limit on number of solutions
% 6.46/6.65
% 6.46/6.65 Resetting weight limit to 44 after 105 givens.
% 6.46/6.65
% 6.67/6.84
% 6.67/6.84
% 6.67/6.84 Changing weight limit from 44 to 32.
% 6.67/6.84
% 6.67/6.84 Resetting weight limit to 32 after 110 givens.
% 6.67/6.84
% 6.67/6.88
% 6.67/6.88
% 6.67/6.88 Changing weight limit from 32 to 28.
% 6.67/6.88
% 6.67/6.88 Resetting weight limit to 28 after 115 givens.
% 6.67/6.88
% 6.82/7.01
% 6.82/7.01
% 6.82/7.01 Changing weight limit from 28 to 24.
% 6.82/7.01
% 6.82/7.01 Resetting weight limit to 24 after 125 givens.
% 6.82/7.01
% 136.36/136.54
% 136.36/136.54 -- HEY sandbox, WE HAVE A PROOF!! --
% 136.36/136.54
% 136.36/136.54 Modelling stopped after 300 given clauses and 0.00 seconds
% 136.36/136.54
% 136.36/136.54
% 136.36/136.54 ----> UNIT CONFLICT at 133.23 sec ----> 657783 [binary,657782.1,2.1] {-} $F.
% 136.36/136.54
% 136.36/136.54 Length of proof is 31. Level of proof is 18.
% 136.36/136.54
% 136.36/136.54 ---------------- PROOF ----------------
% 136.36/136.54 % SZS status Unsatisfiable
% 136.36/136.54 % SZS output start Refutation
% 136.36/136.54
% 136.36/136.54 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 136.36/136.54 2 [] {+} -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))).
% 136.36/136.54 3 [] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))).
% 136.36/136.54 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D))))),equivalent(equivalent(E,F),equivalent(equivalent(E,G),equivalent(F,G))))).
% 136.36/136.54 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 136.36/136.54 7 [hyper,6,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))).
% 136.36/136.54 10 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(equivalent(C,D),equivalent(equivalent(C,E),equivalent(D,E)))),B))).
% 136.36/136.54 14 [hyper,7,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 136.36/136.54 17 [hyper,14,1,14] {+} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,B),C))).
% 136.36/136.54 18 [hyper,14,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),C)),equivalent(equivalent(A,E),equivalent(D,E)))).
% 136.36/136.54 21 [hyper,14,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),E),equivalent(equivalent(A,equivalent(B,D)),E))).
% 136.36/136.54 25 [hyper,17,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(D,C)),equivalent(equivalent(A,B),D))).
% 136.36/136.54 30 [hyper,25,1,17] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 136.36/136.54 31 [hyper,25,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(A,equivalent(B,D)))).
% 136.36/136.54 32 [hyper,30,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 136.36/136.54 35 [hyper,32,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))).
% 136.36/136.54 37 [hyper,32,1,30] {+} is_a_theorem(equivalent(A,A)).
% 136.36/136.54 40 [hyper,31,1,31] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,D))),equivalent(A,C))).
% 136.36/136.54 43 [hyper,31,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(B,D))),equivalent(equivalent(A,D),C))).
% 136.36/136.54 49 [hyper,35,1,31] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(D,C)),equivalent(A,D))).
% 136.36/136.54 53 [hyper,35,1,31] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))).
% 136.36/136.54 73 [hyper,43,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(B,D))),E),equivalent(equivalent(equivalent(A,D),C),E))).
% 136.36/136.54 104 [hyper,10,1,37] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))),A)).
% 136.36/136.54 121 [hyper,49,1,31] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))).
% 136.36/136.54 127 [hyper,121,1,14] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(C,C)),B))).
% 136.36/136.54 216 [hyper,127,1,37] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 136.36/136.54 236 [hyper,216,1,40] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,C),B)),A)).
% 136.36/136.54 395 [hyper,53,1,31] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(E,equivalent(B,D))),equivalent(A,E))).
% 136.36/136.54 577 [hyper,104,1,40] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(C,D),equivalent(equivalent(C,E),equivalent(D,E))),B)),A)).
% 136.36/136.54 1341 [hyper,21,1,236] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 136.36/136.54 1398 [hyper,1341,1,18] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),D),equivalent(A,D))).
% 136.36/136.54 6564 [hyper,1398,1,73] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),E),equivalent(A,equivalent(E,equivalent(equivalent(C,B),D))))).
% 136.36/136.54 35836 [hyper,577,1,395] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(D,equivalent(equivalent(B,E),equivalent(C,E)))),A)).
% 136.36/136.54 657782 [hyper,35836,1,6564] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(B,equivalent(equivalent(C,E),equivalent(D,E))))))).
% 136.36/136.54 657783 [binary,657782.1,2.1] {-} $F.
% 136.36/136.54
% 136.36/136.54 % SZS output end Refutation
% 136.36/136.54 ------------ end of proof -------------
% 136.36/136.54
% 136.36/136.54
% 136.36/136.54 Search stopped by max_proofs option.
% 136.36/136.54
% 136.36/136.54
% 136.36/136.54 Search stopped by max_proofs option.
% 136.36/136.54
% 136.36/136.54 ============ end of search ============
% 136.36/136.54
% 136.36/136.54 ----------- soft-scott stats ----------
% 136.36/136.54
% 136.36/136.54 true clauses given 830 (21.9%)
% 136.36/136.54 false clauses given 2958
% 136.36/136.54
% 136.36/136.54 FALSE TRUE
% 136.36/136.54 20 2091 1242
% 136.36/136.54 24 711 1377
% 136.36/136.54 tot: 2802 2619 (48.3% true)
% 136.36/136.54
% 136.36/136.54
% 136.36/136.54 Model 3 (0.01 seconds, 0 Inserts)
% 136.36/136.54
% 136.36/136.54 That finishes the proof of the theorem.
% 136.36/136.54
% 136.36/136.54 Process 22736 finished Mon Jul 4 05:51:20 2022
%------------------------------------------------------------------------------