TSTP Solution File: LCL107-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL107-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:57 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL107-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 22:07:41 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 sandbox2 on n029.cluster.edu,
% 0.19/0.35 Sun Jul 3 22:07:41 2022
% 0.19/0.35 The command was "./sos". The process ID is 19079.
% 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: 3
% 0.19/0.38 percentage of clauses intially in UL: 66
% 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: 6
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 4
% 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 ===========
% 0.19/0.50
% 0.19/0.50 -------- PROOF --------
% 0.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50 % SZS output start Refutation
% 0.19/0.50
% 0.19/0.50 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.50
% 0.19/0.50 Stopped by limit on number of solutions
% 0.19/0.50
% 0.19/0.50 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.50
% 0.19/0.50 Stopped by limit on number of solutions
% 0.19/0.50
% 0.19/0.50 ----> UNIT CONFLICT at 0.12 sec ----> 180 [binary,179.1,2.1] {+} $F.
% 0.19/0.50
% 0.19/0.50 Length of proof is 9. Level of proof is 8.
% 0.19/0.50
% 0.19/0.50 ---------------- PROOF ----------------
% 0.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50 % SZS output start Refutation
% 0.19/0.50
% 0.19/0.50 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.50 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))).
% 0.19/0.50 3 [] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,E),equivalent(equivalent(equivalent(F,E),equivalent(F,D)),G))),equivalent(C,equivalent(equivalent(B,A),G)))).
% 0.19/0.50 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(C,B),equivalent(C,A)),D)),equivalent(equivalent(equivalent(E,F),equivalent(equivalent(G,E),equivalent(G,F))),D))).
% 0.19/0.50 5 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(equivalent(equivalent(D,equivalent(equivalent(E,F),equivalent(E,G))),equivalent(D,equivalent(F,G))),H)),equivalent(equivalent(B,C),H))).
% 0.19/0.50 6 [hyper,5,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(B,equivalent(C,E)))),equivalent(A,equivalent(D,E))),F),F)).
% 0.19/0.50 7 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D))),equivalent(equivalent(equivalent(E,F),equivalent(E,G)),H)),equivalent(equivalent(equivalent(I,F),equivalent(I,G)),H))).
% 0.19/0.50 20 [hyper,7,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,D)),equivalent(equivalent(equivalent(E,B),equivalent(E,C)),D))).
% 0.19/0.50 26 [hyper,20,1,20] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,B)),equivalent(A,C)),C)).
% 0.19/0.50 38 [hyper,26,1,6] {+} is_a_theorem(equivalent(A,A)).
% 0.19/0.50 47 [hyper,38,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D))).
% 0.19/0.50 179 [hyper,47,1,47] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))).
% 0.19/0.50 180 [binary,179.1,2.1] {+} $F.
% 0.19/0.50
% 0.19/0.50 % SZS output end Refutation
% 0.19/0.50 ------------ end of proof -------------
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Search stopped by max_proofs option.
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Search stopped by max_proofs option.
% 0.19/0.50
% 0.19/0.50 ============ end of search ============
% 0.19/0.50
% 0.19/0.50 ----------- soft-scott stats ----------
% 0.19/0.50
% 0.19/0.50 true clauses given 1 (3.6%)
% 0.19/0.50 false clauses given 27
% 0.19/0.50
% 0.19/0.50 FALSE TRUE
% 0.19/0.50 16 18 1
% 0.19/0.50 20 42 0
% 0.19/0.50 24 31 0
% 0.19/0.50 28 28 0
% 0.19/0.50 32 17 0
% 0.19/0.50 36 6 0
% 0.19/0.50 40 4 0
% 0.19/0.50 tot: 146 1 (0.7% true)
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.50
% 0.19/0.50 That finishes the proof of the theorem.
% 0.19/0.50
% 0.19/0.50 Process 19079 finished Sun Jul 3 22:07:41 2022
%------------------------------------------------------------------------------