TSTP Solution File: LCL097-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL097-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 0.40s 0.59s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL097-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n016.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 06:40:31 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 sandbox on n016.cluster.edu,
% 0.12/0.35 Mon Jul 4 06:40:31 2022
% 0.12/0.35 The command was "./sos". The process ID is 11429.
% 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.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 4
% 0.20/0.38 percentage of clauses intially in UL: 50
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 7
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 1
% 0.20/0.38 distinct constant count: 5
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.40/0.59
% 0.40/0.59 -------- PROOF --------
% 0.40/0.59 % SZS status Unsatisfiable
% 0.40/0.59 % SZS output start Refutation
% 0.40/0.59
% 0.40/0.59 Model 2 (0.00 seconds, 0 Inserts)
% 0.40/0.59
% 0.40/0.59 Stopped by limit on number of solutions
% 0.40/0.59
% 0.40/0.59 Model 3 (0.00 seconds, 0 Inserts)
% 0.40/0.59
% 0.40/0.59 Stopped by limit on number of solutions
% 0.40/0.59
% 0.40/0.59 Model 4 (0.00 seconds, 0 Inserts)
% 0.40/0.59
% 0.40/0.59 Stopped by limit on number of solutions
% 0.40/0.59
% 0.40/0.59 ----> UNIT CONFLICT at 0.20 sec ----> 1317 [binary,1316.1,2.1] {-} $F.
% 0.40/0.59
% 0.40/0.59 Length of proof is 8. Level of proof is 6.
% 0.40/0.59
% 0.40/0.59 ---------------- PROOF ----------------
% 0.40/0.59 % SZS status Unsatisfiable
% 0.40/0.59 % SZS output start Refutation
% 0.40/0.59
% 0.40/0.59 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.40/0.59 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))).
% 0.40/0.59 3 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)).
% 0.40/0.59 4 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D)),E),E)).
% 0.40/0.59 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))).
% 0.40/0.59 6 [hyper,4,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 0.40/0.59 8 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C))).
% 0.40/0.59 9 [hyper,8,1,6] {+} is_a_theorem(equivalent(A,A)).
% 0.40/0.59 12 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(equivalent(C,D),equivalent(C,E)),A),equivalent(equivalent(D,E),B)))).
% 0.40/0.59 14 [hyper,5,1,9] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 0.40/0.59 28 [hyper,14,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,D)),E)),equivalent(A,equivalent(equivalent(C,D),E)))).
% 0.40/0.59 1316 [hyper,28,1,12] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(equivalent(equivalent(A,E),C),equivalent(equivalent(B,E),D)))).
% 0.40/0.59 1317 [binary,1316.1,2.1] {-} $F.
% 0.40/0.59
% 0.40/0.59 % SZS output end Refutation
% 0.40/0.59 ------------ end of proof -------------
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Search stopped by max_proofs option.
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Search stopped by max_proofs option.
% 0.40/0.59
% 0.40/0.59 ============ end of search ============
% 0.40/0.59
% 0.40/0.59 ----------- soft-scott stats ----------
% 0.40/0.59
% 0.40/0.59 true clauses given 8 (14.3%)
% 0.40/0.59 false clauses given 48
% 0.40/0.59
% 0.40/0.59 FALSE TRUE
% 0.40/0.59 16 77 30
% 0.40/0.59 20 325 58
% 0.40/0.59 24 446 0
% 0.40/0.59 28 199 0
% 0.40/0.59 32 73 0
% 0.40/0.59 36 13 0
% 0.40/0.59 40 2 0
% 0.40/0.59 tot: 1135 88 (7.2% true)
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Model 4 (0.00 seconds, 0 Inserts)
% 0.40/0.59
% 0.40/0.59 That finishes the proof of the theorem.
% 0.40/0.59
% 0.40/0.59 Process 11429 finished Mon Jul 4 06:40:32 2022
%------------------------------------------------------------------------------