TSTP Solution File: LCL023-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL023-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:25 EDT 2022
% Result : Unsatisfiable 38.04s 38.28s
% Output : Refutation 38.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 19:03:30 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n020.cluster.edu,
% 0.14/0.37 Sat Jul 2 19:03:30 2022
% 0.14/0.37 The command was "./sos". The process ID is 13991.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set without equality. The strategy will
% 0.14/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.37 in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 2
% 0.14/0.39 number of clauses initially in problem: 3
% 0.14/0.39 percentage of clauses intially in UL: 66
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 5
% 0.14/0.39 distinct predicate count: 1
% 0.14/0.39 distinct function count: 1
% 0.14/0.39 distinct constant count: 3
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 38.04/38.28
% 38.04/38.28 -- HEY sandbox, WE HAVE A PROOF!! --
% 38.04/38.28
% 38.04/38.28 Model 2 (0.00 seconds, 0 Inserts)
% 38.04/38.28
% 38.04/38.28 Stopped by limit on number of solutions
% 38.04/38.28
% 38.04/38.28 Model 3 [ 1 347 183134 ] (0.00 seconds, 185228 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 4 [ 1 1 571 ] (0.00 seconds, 164312 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 5 [ 3 1 1110 ] (0.00 seconds, 159354 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 6 [ 3 0 124 ] (0.00 seconds, 169889 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 7 [ 4 0 450 ] (0.00 seconds, 161400 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 8 [ 4 1 690 ] (0.00 seconds, 185341 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 9 [ 14 1 367 ] (0.00 seconds, 168099 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 10 [ 5 351 182969 ] (0.00 seconds, 185255 Inserts)
% 38.04/38.28
% 38.04/38.28 Model 11 [ 14 352 168709 ] (0.00 seconds, 170117 Inserts)
% 38.04/38.28
% 38.04/38.28 ----> UNIT CONFLICT at 37.89 sec ----> 987 [binary,986.1,2.1] {-} $F.
% 38.04/38.28
% 38.04/38.28 Length of proof is 13. Level of proof is 10.
% 38.04/38.28
% 38.04/38.28 ---------------- PROOF ----------------
% 38.04/38.28 % SZS status Unsatisfiable
% 38.04/38.28 % SZS output start Refutation
% 38.04/38.28
% 38.04/38.28 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 38.04/38.28 2 [] {+} -is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))).
% 38.04/38.28 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(A,C)))).
% 38.04/38.28 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,B))),equivalent(equivalent(D,C),A))).
% 38.04/38.28 7 [hyper,4,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 38.04/38.28 8 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(B,C),A))).
% 38.04/38.28 9 [hyper,8,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(A,B)))).
% 38.04/38.28 10 [hyper,8,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))).
% 38.04/38.28 13 [hyper,8,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(C,B))).
% 38.04/38.28 37 [hyper,13,1,10] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)).
% 38.04/38.28 38 [hyper,13,1,9] {+} is_a_theorem(equivalent(A,A)).
% 38.04/38.28 40 [hyper,38,1,10] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 38.04/38.28 60 [hyper,40,1,37] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),B))).
% 38.04/38.28 66 [hyper,60,1,13] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 38.04/38.28 88 [hyper,66,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,equivalent(C,B)),A))).
% 38.04/38.28 986 [hyper,88,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,B),C))).
% 38.04/38.28 987 [binary,986.1,2.1] {-} $F.
% 38.04/38.28
% 38.04/38.28 % SZS output end Refutation
% 38.04/38.28 ------------ end of proof -------------
% 38.04/38.28
% 38.04/38.28
% 38.04/38.28 Search stopped by max_proofs option.
% 38.04/38.28
% 38.04/38.28
% 38.04/38.28 Search stopped by max_proofs option.
% 38.04/38.28
% 38.04/38.28 ============ end of search ============
% 38.04/38.28
% 38.04/38.28 ----------- soft-scott stats ----------
% 38.04/38.28
% 38.04/38.28 true clauses given 4 (8.3%)
% 38.04/38.28 false clauses given 44
% 38.04/38.28
% 38.04/38.28 FALSE TRUE
% 38.04/38.28 12 179 45
% 38.04/38.28 16 350 0
% 38.04/38.28 20 164 0
% 38.04/38.28 24 118 0
% 38.04/38.28 28 40 0
% 38.04/38.28 32 8 0
% 38.04/38.28 36 4 0
% 38.04/38.28 tot: 863 45 (5.0% true)
% 38.04/38.28
% 38.04/38.28
% 38.04/38.28 Model 11 [ 14 352 168709 ] (0.00 seconds, 170117 Inserts)
% 38.04/38.28
% 38.04/38.28 That finishes the proof of the theorem.
% 38.04/38.28
% 38.04/38.28 Process 13991 finished Sat Jul 2 19:04:08 2022
%------------------------------------------------------------------------------