TSTP Solution File: LCL108-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL108-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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.46s 0.65s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL108-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 07:23:31 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n021.cluster.edu,
% 0.13/0.36 Mon Jul 4 07:23:31 2022
% 0.13/0.36 The command was "./sos". The process ID is 4184.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 2
% 0.13/0.39 number of clauses initially in problem: 3
% 0.13/0.39 percentage of clauses intially in UL: 66
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 5
% 0.13/0.39 distinct predicate count: 1
% 0.13/0.39 distinct function count: 1
% 0.13/0.39 distinct constant count: 3
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.46/0.65
% 0.46/0.65 -------- PROOF --------
% 0.46/0.65 % SZS status Unsatisfiable
% 0.46/0.65 % SZS output start Refutation
% 0.46/0.65
% 0.46/0.65 Model 2 (0.00 seconds, 0 Inserts)
% 0.46/0.65
% 0.46/0.65 Stopped by limit on number of solutions
% 0.46/0.65
% 0.46/0.65 ----> UNIT CONFLICT at 0.26 sec ----> 401 [binary,400.1,2.1] {+} $F.
% 0.46/0.65
% 0.46/0.65 Length of proof is 10. Level of proof is 8.
% 0.46/0.65
% 0.46/0.65 ---------------- PROOF ----------------
% 0.46/0.65 % SZS status Unsatisfiable
% 0.46/0.65 % SZS output start Refutation
% 0.46/0.65
% 0.46/0.65 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.46/0.65 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),c)).
% 0.46/0.65 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.46/0.65 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.46/0.65 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.46/0.65 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.46/0.65 8 [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(F,G),H))).
% 0.46/0.65 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.46/0.65 26 [hyper,20,1,20] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,B)),equivalent(A,C)),C)).
% 0.46/0.65 54 [hyper,8,1,26] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 0.46/0.65 55 [hyper,8,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(D,A),equivalent(D,B)),C))).
% 0.46/0.65 70 [hyper,54,1,26] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,C)),equivalent(B,D))),equivalent(A,D))).
% 0.46/0.65 400 [hyper,70,1,55] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)).
% 0.46/0.65 401 [binary,400.1,2.1] {+} $F.
% 0.46/0.65
% 0.46/0.65 % SZS output end Refutation
% 0.46/0.65 ------------ end of proof -------------
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 Search stopped by max_proofs option.
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 Search stopped by max_proofs option.
% 0.46/0.65
% 0.46/0.65 ============ end of search ============
% 0.46/0.65
% 0.46/0.65 ----------- soft-scott stats ----------
% 0.46/0.65
% 0.46/0.65 true clauses given 3 (7.9%)
% 0.46/0.65 false clauses given 35
% 0.46/0.65
% 0.46/0.65 FALSE TRUE
% 0.46/0.65 16 30 4
% 0.46/0.65 20 105 0
% 0.46/0.65 24 78 0
% 0.46/0.65 28 56 0
% 0.46/0.65 32 39 0
% 0.46/0.65 36 17 0
% 0.46/0.65 40 14 0
% 0.46/0.65 tot: 339 4 (1.2% true)
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 Model 2 (0.00 seconds, 0 Inserts)
% 0.46/0.65
% 0.46/0.65 That finishes the proof of the theorem.
% 0.46/0.65
% 0.46/0.65 Process 4184 finished Mon Jul 4 07:23:32 2022
%------------------------------------------------------------------------------