TSTP Solution File: LCL096-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL096-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:54 EDT 2022
% Result : Unsatisfiable 5.62s 5.84s
% Output : Refutation 5.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL096-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n020.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 : Sun Jul 3 04:28:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.19/0.35 Sun Jul 3 04:28:30 2022
% 0.19/0.35 The command was "./sos". The process ID is 8588.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35
% 0.19/0.35 This is a Horn set without equality. The strategy will
% 0.19/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35 in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35
% 0.19/0.35 ======= 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: 5
% 0.19/0.38 percentage of clauses intially in UL: 40
% 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 ===========
% 4.11/4.36
% 4.11/4.36
% 4.11/4.36 Changing weight limit from 60 to 40.
% 4.11/4.36
% 4.11/4.36 Model 2 (0.00 seconds, 0 Inserts)
% 4.11/4.36
% 4.11/4.36 Stopped by limit on number of solutions
% 4.11/4.36
% 4.11/4.36 Model 3 (0.00 seconds, 0 Inserts)
% 4.11/4.36
% 4.11/4.36 Stopped by limit on number of solutions
% 4.11/4.36
% 4.11/4.36 Model 4 [ 1 2 2508 ] (0.00 seconds, 193629 Inserts)
% 4.11/4.36
% 4.11/4.36 Resetting weight limit to 40 after 85 givens.
% 4.11/4.36
% 4.27/4.48
% 4.27/4.48
% 4.27/4.48 Changing weight limit from 40 to 28.
% 4.27/4.48
% 4.27/4.48 Resetting weight limit to 28 after 90 givens.
% 4.27/4.48
% 4.39/4.63
% 4.39/4.63
% 4.39/4.63 Changing weight limit from 28 to 24.
% 4.39/4.63
% 4.39/4.63 Resetting weight limit to 24 after 105 givens.
% 4.39/4.63
% 5.54/5.74
% 5.54/5.74
% 5.54/5.74 Changing weight limit from 24 to 20.
% 5.54/5.74
% 5.54/5.74 Resetting weight limit to 20 after 260 givens.
% 5.54/5.74
% 5.62/5.84
% 5.62/5.84 -------- PROOF --------
% 5.62/5.84 % SZS status Unsatisfiable
% 5.62/5.84 % SZS output start Refutation
% 5.62/5.84
% 5.62/5.84 ----> UNIT CONFLICT at 5.43 sec ----> 13977 [binary,13976.1,2.1] {-} $F.
% 5.62/5.84
% 5.62/5.84 Length of proof is 20. Level of proof is 9.
% 5.62/5.84
% 5.62/5.84 ---------------- PROOF ----------------
% 5.62/5.84 % SZS status Unsatisfiable
% 5.62/5.84 % SZS output start Refutation
% 5.62/5.84
% 5.62/5.84 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 5.62/5.84 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)).
% 5.62/5.84 3 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)).
% 5.62/5.84 4 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D)),E),E)).
% 5.62/5.84 5 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(equivalent(equivalent(A,E),C),equivalent(equivalent(B,E),D)))).
% 5.62/5.84 6 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))).
% 5.62/5.84 7 [hyper,4,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 5.62/5.84 9 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C))).
% 5.62/5.84 10 [hyper,9,1,7] {+} is_a_theorem(equivalent(A,A)).
% 5.62/5.84 11 [hyper,5,1,9] {+} is_a_theorem(equivalent(A,equivalent(equivalent(B,B),A))).
% 5.62/5.84 14 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),E),F),equivalent(equivalent(equivalent(equivalent(B,C),D),E),F))).
% 5.62/5.84 15 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),E),equivalent(equivalent(equivalent(B,C),D),E))).
% 5.62/5.84 28 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(equivalent(B,D),A),equivalent(D,C)))).
% 5.62/5.84 30 [hyper,6,1,10] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 5.62/5.84 146 [hyper,28,1,11] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,A),B),C),equivalent(B,C))).
% 5.62/5.84 182 [hyper,14,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,B)),C),C)).
% 5.62/5.84 192 [hyper,146,1,30] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,C)),equivalent(B,A)))).
% 5.62/5.84 214 [hyper,192,1,9] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(B,equivalent(C,C)),A)))).
% 5.62/5.84 285 [hyper,15,1,182] {+} is_a_theorem(equivalent(equivalent(equivalent(A,A),B),B)).
% 5.62/5.84 302 [hyper,285,1,30] {+} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),equivalent(A,C))).
% 5.62/5.84 467 [hyper,214,1,28] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(equivalent(A,equivalent(D,D)),C)))).
% 5.62/5.84 804 [hyper,302,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,B)),equivalent(A,C)),C)).
% 5.62/5.84 839 [hyper,804,1,15] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)).
% 5.62/5.84 896 [hyper,839,1,30] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),D))),equivalent(A,D))).
% 5.62/5.84 13976 [hyper,896,1,467] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),A)),C),C)).
% 5.62/5.84 13977 [binary,13976.1,2.1] {-} $F.
% 5.62/5.84
% 5.62/5.84 % SZS output end Refutation
% 5.62/5.84 ------------ end of proof -------------
% 5.62/5.84
% 5.62/5.84
% 5.62/5.84 Search stopped by max_proofs option.
% 5.62/5.84
% 5.62/5.84
% 5.62/5.84 Search stopped by max_proofs option.
% 5.62/5.84
% 5.62/5.84 ============ end of search ============
% 5.62/5.84
% 5.62/5.84 ----------- soft-scott stats ----------
% 5.62/5.84
% 5.62/5.84 true clauses given 6 (2.0%)
% 5.62/5.84 false clauses given 296
% 5.62/5.84
% 5.62/5.84 FALSE TRUE
% 5.62/5.84 16 148 8
% 5.62/5.84 20 2376 10
% 5.62/5.84 tot: 2524 18 (0.7% true)
% 5.62/5.84
% 5.62/5.84
% 5.62/5.84 Model 4 [ 1 2 2508 ] (0.00 seconds, 193629 Inserts)
% 5.62/5.84
% 5.62/5.84 That finishes the proof of the theorem.
% 5.62/5.84
% 5.62/5.84 Process 8588 finished Sun Jul 3 04:28:35 2022
%------------------------------------------------------------------------------