TSTP Solution File: LCL102-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:55 EDT 2022
% Result : Unsatisfiable 1.42s 1.60s
% Output : Refutation 1.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n015.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 14:31:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n015.cluster.edu,
% 0.12/0.35 Mon Jul 4 14:31:46 2022
% 0.12/0.35 The command was "./sos". The process ID is 6276.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 5
% 0.12/0.38 percentage of clauses intially in UL: 40
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 6
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 1
% 0.12/0.38 distinct constant count: 4
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 1.11/1.34
% 1.11/1.34
% 1.11/1.34 Changing weight limit from 60 to 32.
% 1.11/1.34
% 1.11/1.34 Model 2 (0.00 seconds, 0 Inserts)
% 1.11/1.34
% 1.11/1.34 Stopped by limit on number of solutions
% 1.11/1.34
% 1.11/1.34 Model 3 (0.00 seconds, 0 Inserts)
% 1.11/1.34
% 1.11/1.34 Stopped by limit on number of solutions
% 1.11/1.34
% 1.11/1.34 Resetting weight limit to 32 after 85 givens.
% 1.11/1.34
% 1.25/1.49
% 1.25/1.49
% 1.25/1.49 Changing weight limit from 32 to 28.
% 1.25/1.49
% 1.25/1.49 Resetting weight limit to 28 after 100 givens.
% 1.25/1.49
% 1.42/1.60
% 1.42/1.60 -------- PROOF --------
% 1.42/1.60 % SZS status Unsatisfiable
% 1.42/1.60 % SZS output start Refutation
% 1.42/1.60
% 1.42/1.60 ----> UNIT CONFLICT at 1.22 sec ----> 4113 [binary,4112.1,2.1] {-} $F.
% 1.42/1.60
% 1.42/1.60 Length of proof is 9. Level of proof is 5.
% 1.42/1.60
% 1.42/1.60 ---------------- PROOF ----------------
% 1.42/1.60 % SZS status Unsatisfiable
% 1.42/1.60 % SZS output start Refutation
% 1.42/1.60
% 1.42/1.60 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.42/1.60 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))).
% 1.42/1.60 3 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)).
% 1.42/1.60 4 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),A)))).
% 1.42/1.60 5 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 1.42/1.60 9 [hyper,5,1,5] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(D,B),equivalent(D,C))))).
% 1.42/1.60 11 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D)))).
% 1.42/1.60 12 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,equivalent(equivalent(C,D),equivalent(equivalent(D,C),B))))).
% 1.42/1.60 23 [hyper,11,1,5] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(C,E)))),equivalent(A,equivalent(B,equivalent(D,E))))).
% 1.42/1.60 26 [hyper,11,1,9] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(B,D)),equivalent(C,equivalent(A,D)))).
% 1.42/1.60 95 [hyper,12,1,11] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(C,equivalent(equivalent(B,A),D)))).
% 1.42/1.60 265 [hyper,26,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(D,A),equivalent(D,B)),C))).
% 1.42/1.60 1019 [hyper,265,1,95] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(equivalent(D,C),equivalent(D,B)),A)))).
% 1.42/1.60 4112 [hyper,1019,1,23] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))).
% 1.42/1.60 4113 [binary,4112.1,2.1] {-} $F.
% 1.42/1.60
% 1.42/1.60 % SZS output end Refutation
% 1.42/1.60 ------------ end of proof -------------
% 1.42/1.60
% 1.42/1.60
% 1.42/1.60 Search stopped by max_proofs option.
% 1.42/1.60
% 1.42/1.60
% 1.42/1.60 Search stopped by max_proofs option.
% 1.42/1.60
% 1.42/1.60 ============ end of search ============
% 1.42/1.60
% 1.42/1.60 ----------- soft-scott stats ----------
% 1.42/1.60
% 1.42/1.60 true clauses given 14 (12.7%)
% 1.42/1.60 false clauses given 96
% 1.42/1.60
% 1.42/1.60 FALSE TRUE
% 1.42/1.60 12 0 2
% 1.42/1.60 16 137 38
% 1.42/1.60 20 815 45
% 1.42/1.60 24 1270 0
% 1.42/1.60 28 278 0
% 1.42/1.60 tot: 2500 85 (3.3% true)
% 1.42/1.60
% 1.42/1.60
% 1.42/1.60 Model 3 (0.00 seconds, 0 Inserts)
% 1.42/1.60
% 1.42/1.60 That finishes the proof of the theorem.
% 1.42/1.60
% 1.42/1.60 Process 6276 finished Mon Jul 4 14:31:47 2022
%------------------------------------------------------------------------------