TSTP Solution File: LCL118-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL118-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:28:03 EDT 2022
% Result : Unsatisfiable 4.09s 4.30s
% Output : Refutation 4.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL118-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 05:47:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox on n013.cluster.edu,
% 0.20/0.37 Sun Jul 3 05:47:29 2022
% 0.20/0.37 The command was "./sos". The process ID is 9633.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.20/0.37
% 0.20/0.37 This is a Horn set without equality. The strategy will
% 0.20/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.37 in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: clear(order_hyper).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 2
% 0.20/0.39 number of clauses initially in problem: 3
% 0.20/0.39 percentage of clauses intially in UL: 66
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 5
% 0.20/0.39 distinct predicate count: 1
% 0.20/0.39 distinct function count: 1
% 0.20/0.39 distinct constant count: 3
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 4.09/4.30
% 4.09/4.30 -------- PROOF --------
% 4.09/4.30 % SZS status Unsatisfiable
% 4.09/4.30 % SZS output start Refutation
% 4.09/4.30
% 4.09/4.30 Model 2 (0.00 seconds, 0 Inserts)
% 4.09/4.30
% 4.09/4.30 Stopped by limit on number of solutions
% 4.09/4.30
% 4.09/4.30 Model 3 (0.00 seconds, 0 Inserts)
% 4.09/4.30
% 4.09/4.30 Stopped by limit on number of solutions
% 4.09/4.30
% 4.09/4.30 Model 4 (0.00 seconds, 0 Inserts)
% 4.09/4.30
% 4.09/4.30 Stopped by limit on number of solutions
% 4.09/4.30
% 4.09/4.30 ----> UNIT CONFLICT at 3.90 sec ----> 1111 [binary,1110.1,2.1] {-} $F.
% 4.09/4.30
% 4.09/4.30 Length of proof is 14. Level of proof is 10.
% 4.09/4.30
% 4.09/4.30 ---------------- PROOF ----------------
% 4.09/4.30 % SZS status Unsatisfiable
% 4.09/4.30 % SZS output start Refutation
% 4.09/4.30
% 4.09/4.30 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.09/4.30 2 [] {+} -is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))).
% 4.09/4.30 3 [] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,equivalent(B,A)))).
% 4.09/4.30 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(B,equivalent(A,C))))).
% 4.09/4.30 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,equivalent(D,B))),equivalent(equivalent(D,C),A)))).
% 4.09/4.30 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(equivalent(D,equivalent(C,B)),A)))).
% 4.09/4.30 9 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,equivalent(B,equivalent(A,D))),C))).
% 4.09/4.30 15 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),equivalent(equivalent(C,equivalent(B,A)),D))).
% 4.09/4.30 17 [hyper,6,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,equivalent(B,A)),equivalent(equivalent(D,E),equivalent(F,equivalent(E,equivalent(D,F))))))).
% 4.09/4.30 25 [hyper,9,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,A))),equivalent(D,equivalent(B,equivalent(C,D))))).
% 4.09/4.30 46 [hyper,15,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,C)))).
% 4.09/4.30 51 [hyper,46,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(C,equivalent(A,B))))).
% 4.09/4.30 75 [hyper,25,1,51] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,A)))).
% 4.09/4.30 99 [hyper,75,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 4.09/4.30 102 [hyper,99,1,9] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,A))),equivalent(C,B))).
% 4.09/4.30 1040 [hyper,17,1,102] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 4.09/4.30 1110 [hyper,1040,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(C,A)))).
% 4.09/4.30 1111 [binary,1110.1,2.1] {-} $F.
% 4.09/4.30
% 4.09/4.30 % SZS output end Refutation
% 4.09/4.30 ------------ end of proof -------------
% 4.09/4.30
% 4.09/4.30
% 4.09/4.30 Search stopped by max_proofs option.
% 4.09/4.30
% 4.09/4.30
% 4.09/4.30 Search stopped by max_proofs option.
% 4.09/4.30
% 4.09/4.30 ============ end of search ============
% 4.09/4.30
% 4.09/4.30 ----------- soft-scott stats ----------
% 4.09/4.30
% 4.09/4.30 true clauses given 6 (12.8%)
% 4.09/4.30 false clauses given 41
% 4.09/4.30
% 4.09/4.30 FALSE TRUE
% 4.09/4.30 12 0 31
% 4.09/4.30 16 134 52
% 4.09/4.30 20 280 21
% 4.09/4.30 24 154 0
% 4.09/4.30 28 154 0
% 4.09/4.30 32 96 0
% 4.09/4.30 36 57 0
% 4.09/4.30 40 24 0
% 4.09/4.30 44 16 0
% 4.09/4.30 tot: 915 104 (10.2% true)
% 4.09/4.30
% 4.09/4.30
% 4.09/4.30 Model 4 (0.00 seconds, 0 Inserts)
% 4.09/4.30
% 4.09/4.30 That finishes the proof of the theorem.
% 4.09/4.30
% 4.09/4.30 Process 9633 finished Sun Jul 3 05:47:33 2022
%------------------------------------------------------------------------------