TSTP Solution File: LCL104-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL104-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:56 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL104-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n012.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 03:56:16 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 n012.cluster.edu,
% 0.12/0.35 Mon Jul 4 03:56:16 2022
% 0.12/0.35 The command was "./sos". The process ID is 24792.
% 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: 4
% 0.12/0.38 percentage of clauses intially in UL: 50
% 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 ===========
% 0.19/0.43
% 0.19/0.43 -------- PROOF --------
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 ----> UNIT CONFLICT at 0.05 sec ----> 140 [binary,139.1,2.1] {-} $F.
% 0.19/0.43
% 0.19/0.43 Length of proof is 7. Level of proof is 6.
% 0.19/0.43
% 0.19/0.43 ---------------- PROOF ----------------
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.43 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))).
% 0.19/0.43 3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(B,D)),equivalent(C,D)),A))).
% 0.19/0.43 4 [] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)).
% 0.19/0.43 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 0.19/0.43 8 [hyper,7,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(D,B),equivalent(D,C))))).
% 0.19/0.43 11 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),D))),equivalent(A,D))).
% 0.19/0.43 27 [hyper,11,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C))).
% 0.19/0.43 32 [hyper,27,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D)))).
% 0.19/0.43 78 [hyper,32,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D))).
% 0.19/0.43 139 [hyper,78,1,78] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))).
% 0.19/0.43 140 [binary,139.1,2.1] {-} $F.
% 0.19/0.43
% 0.19/0.43 % SZS output end Refutation
% 0.19/0.43 ------------ end of proof -------------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43 ============ end of search ============
% 0.19/0.43
% 0.19/0.43 ----------- soft-scott stats ----------
% 0.19/0.43
% 0.19/0.43 true clauses given 0 (0.0%)
% 0.19/0.43 false clauses given 23
% 0.19/0.43
% 0.19/0.43 FALSE TRUE
% 0.19/0.43 16 4 0
% 0.19/0.43 20 38 0
% 0.19/0.43 24 32 0
% 0.19/0.43 28 30 0
% 0.19/0.43 32 5 0
% 0.19/0.43 36 3 0
% 0.19/0.43 40 1 0
% 0.19/0.43 tot: 113 0 (0.0% true)
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 That finishes the proof of the theorem.
% 0.19/0.43
% 0.19/0.43 Process 24792 finished Mon Jul 4 03:56:16 2022
%------------------------------------------------------------------------------