TSTP Solution File: LCL022-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:24 EDT 2022
% Result : Unsatisfiable 46.01s 46.18s
% Output : Refutation 46.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 4 15:38:25 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.35 ----- Otter 3.2, August 2001 -----
% 0.11/0.35 The process was started by sandbox on n003.cluster.edu,
% 0.11/0.35 Mon Jul 4 15:38:25 2022
% 0.11/0.35 The command was "./sos". The process ID is 19743.
% 0.11/0.35
% 0.11/0.35 set(prolog_style_variables).
% 0.11/0.35 set(auto).
% 0.11/0.35 dependent: set(auto1).
% 0.11/0.35 dependent: set(process_input).
% 0.11/0.35 dependent: clear(print_kept).
% 0.11/0.35 dependent: clear(print_new_demod).
% 0.11/0.35 dependent: clear(print_back_demod).
% 0.11/0.35 dependent: clear(print_back_sub).
% 0.11/0.35 dependent: set(control_memory).
% 0.11/0.35 dependent: assign(max_mem, 12000).
% 0.11/0.35 dependent: assign(pick_given_ratio, 4).
% 0.11/0.35 dependent: assign(stats_level, 1).
% 0.11/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35 dependent: assign(sos_limit, 5000).
% 0.11/0.35 dependent: assign(max_weight, 60).
% 0.11/0.35 clear(print_given).
% 0.11/0.35
% 0.11/0.35 list(usable).
% 0.11/0.35
% 0.11/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.11/0.35
% 0.11/0.35 This is a Horn set without equality. The strategy will
% 0.11/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.11/0.35 in usable.
% 0.11/0.35
% 0.11/0.35 dependent: set(hyper_res).
% 0.11/0.35 dependent: clear(order_hyper).
% 0.11/0.35
% 0.11/0.35 ------------> process usable:
% 0.11/0.35
% 0.11/0.35 ------------> process sos:
% 0.11/0.35
% 0.11/0.35 ======= end of input processing =======
% 0.11/0.37
% 0.11/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.37
% 0.11/0.37 Stopped by limit on number of solutions
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 -------------- Softie stats --------------
% 0.11/0.37
% 0.11/0.37 UPDATE_STOP: 300
% 0.11/0.37 SFINDER_TIME_LIMIT: 2
% 0.11/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.37 number of clauses in intial UL: 2
% 0.11/0.37 number of clauses initially in problem: 3
% 0.11/0.37 percentage of clauses intially in UL: 66
% 0.11/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.11/0.37 percent of all initial clauses that are short: 100
% 0.11/0.37 absolute distinct symbol count: 5
% 0.11/0.37 distinct predicate count: 1
% 0.11/0.37 distinct function count: 1
% 0.11/0.37 distinct constant count: 3
% 0.11/0.37
% 0.11/0.37 ---------- no more Softie stats ----------
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 =========== start of search ===========
% 46.01/46.18
% 46.01/46.18 -- HEY sandbox, WE HAVE A PROOF!! --
% 46.01/46.18
% 46.01/46.18 Model 2 (0.00 seconds, 0 Inserts)
% 46.01/46.18
% 46.01/46.18 Stopped by limit on number of solutions
% 46.01/46.18
% 46.01/46.18 Model 3 [ 1 0 426 ] (0.00 seconds, 228579 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 4 [ 1 0 1018 ] (0.00 seconds, 229255 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 5 [ 3 1 765 ] (0.00 seconds, 227399 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 6 [ 3 1 226 ] (0.00 seconds, 225805 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 7 [ 4 1 736 ] (0.00 seconds, 231281 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 8 [ 11 0 432 ] (0.00 seconds, 229805 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 9 [ 5 0 181 ] (0.00 seconds, 225337 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 10 [ 5 1 126 ] (0.00 seconds, 225292 Inserts)
% 46.01/46.18
% 46.01/46.18 Model 11 [ 14 0 410 ] (0.00 seconds, 236024 Inserts)
% 46.01/46.18
% 46.01/46.18 ----> UNIT CONFLICT at 45.81 sec ----> 373 [binary,372.1,2.1] {-} $F.
% 46.01/46.18
% 46.01/46.18 Length of proof is 11. Level of proof is 7.
% 46.01/46.18
% 46.01/46.18 ---------------- PROOF ----------------
% 46.01/46.18 % SZS status Unsatisfiable
% 46.01/46.18 % SZS output start Refutation
% 46.01/46.18
% 46.01/46.18 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 46.01/46.18 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))).
% 46.01/46.18 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(A,C)))).
% 46.01/46.18 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,B))),equivalent(equivalent(D,C),A))).
% 46.01/46.18 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(equivalent(D,B),equivalent(C,D))))).
% 46.01/46.18 7 [hyper,4,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 46.01/46.18 8 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(B,C),A))).
% 46.01/46.18 9 [hyper,8,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(A,B)))).
% 46.01/46.18 10 [hyper,8,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))).
% 46.01/46.18 13 [hyper,8,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(C,B))).
% 46.01/46.18 38 [hyper,13,1,9] {+} is_a_theorem(equivalent(A,A)).
% 46.01/46.18 40 [hyper,38,1,10] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 46.01/46.18 41 [hyper,38,1,5] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(B,C)))).
% 46.01/46.18 372 [hyper,41,1,40] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(B,C))).
% 46.01/46.18 373 [binary,372.1,2.1] {-} $F.
% 46.01/46.18
% 46.01/46.18 % SZS output end Refutation
% 46.01/46.18 ------------ end of proof -------------
% 46.01/46.18
% 46.01/46.18
% 46.01/46.18 Search stopped by max_proofs option.
% 46.01/46.18
% 46.01/46.18
% 46.01/46.18 Search stopped by max_proofs option.
% 46.01/46.18
% 46.01/46.18 ============ end of search ============
% 46.01/46.18
% 46.01/46.18 ----------- soft-scott stats ----------
% 46.01/46.18
% 46.01/46.18 true clauses given 3 (10.0%)
% 46.01/46.18 false clauses given 27
% 46.01/46.18
% 46.01/46.18 FALSE TRUE
% 46.01/46.18 8 0 1
% 46.01/46.18 12 90 38
% 46.01/46.18 16 89 0
% 46.01/46.18 20 60 0
% 46.01/46.18 24 29 0
% 46.01/46.18 28 15 0
% 46.01/46.18 32 2 0
% 46.01/46.18 36 1 0
% 46.01/46.18 tot: 286 39 (12.0% true)
% 46.01/46.18
% 46.01/46.18
% 46.01/46.18 Model 11 [ 14 0 410 ] (0.00 seconds, 236024 Inserts)
% 46.01/46.18
% 46.01/46.18 That finishes the proof of the theorem.
% 46.01/46.18
% 46.01/46.18 Process 19743 finished Mon Jul 4 15:39:11 2022
%------------------------------------------------------------------------------