TSTP Solution File: LCL083-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL083-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:49 EDT 2022
% Result : Unsatisfiable 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL083-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 22:19:05 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.34 Mon Jul 4 22:19:05 2022
% 0.12/0.34 The command was "./sos". The process ID is 14408.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a Horn set without equality. The strategy will
% 0.12/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34 in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.36
% 0.12/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.36
% 0.12/0.36 Stopped by limit on number of solutions
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 -------------- Softie stats --------------
% 0.12/0.36
% 0.12/0.36 UPDATE_STOP: 300
% 0.12/0.36 SFINDER_TIME_LIMIT: 2
% 0.12/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.36 number of clauses in intial UL: 2
% 0.12/0.36 number of clauses initially in problem: 4
% 0.12/0.36 percentage of clauses intially in UL: 50
% 0.12/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.36 percent of all initial clauses that are short: 100
% 0.12/0.36 absolute distinct symbol count: 4
% 0.12/0.36 distinct predicate count: 1
% 0.12/0.36 distinct function count: 1
% 0.12/0.36 distinct constant count: 2
% 0.12/0.36
% 0.12/0.36 ---------- no more Softie stats ----------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 =========== start of search ===========
% 0.17/0.46
% 0.17/0.46 -------- PROOF --------
% 0.17/0.46 % SZS status Unsatisfiable
% 0.17/0.46 % SZS output start Refutation
% 0.17/0.46
% 0.17/0.46 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.46
% 0.17/0.46 Stopped by limit on number of solutions
% 0.17/0.46
% 0.17/0.46 Model 3 (0.00 seconds, 0 Inserts)
% 0.17/0.46
% 0.17/0.46 Stopped by limit on number of solutions
% 0.17/0.46
% 0.17/0.46 Model 4 (0.00 seconds, 0 Inserts)
% 0.17/0.46
% 0.17/0.46 Stopped by limit on number of solutions
% 0.17/0.46
% 0.17/0.46 Model 5 (0.00 seconds, 0 Inserts)
% 0.17/0.46
% 0.17/0.46 Stopped by limit on number of solutions
% 0.17/0.46
% 0.17/0.46 ----> UNIT CONFLICT at 0.09 sec ----> 144 [binary,143.1,2.1] {-} $F.
% 0.17/0.46
% 0.17/0.46 Length of proof is 12. Level of proof is 9.
% 0.17/0.46
% 0.17/0.46 ---------------- PROOF ----------------
% 0.17/0.46 % SZS status Unsatisfiable
% 0.17/0.46 % SZS output start Refutation
% 0.17/0.46
% 0.17/0.46 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.17/0.46 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 0.17/0.46 3 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))).
% 0.17/0.46 4 [] {+} is_a_theorem(implies(A,A)).
% 0.17/0.46 6 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 0.17/0.46 7 [hyper,6,1,6] {+} is_a_theorem(implies(A,implies(B,B))).
% 0.17/0.46 8 [hyper,6,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(B,C)),implies(D,implies(B,C)))).
% 0.17/0.46 9 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 0.17/0.46 28 [hyper,8,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(D,B)),implies(E,implies(D,B)))).
% 0.17/0.46 46 [hyper,28,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),D),C),implies(B,C)))).
% 0.17/0.46 49 [hyper,46,1,46] {-} is_a_theorem(implies(implies(implies(implies(A,B),C),B),implies(A,B))).
% 0.17/0.46 52 [hyper,49,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(A,B),C)),implies(D,implies(implies(A,B),C)))).
% 0.17/0.46 128 [hyper,52,1,9] {-} is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))).
% 0.17/0.46 130 [hyper,52,1,6] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 0.17/0.46 132 [hyper,128,1,128] {+} is_a_theorem(implies(implies(implies(A,A),B),B)).
% 0.17/0.46 143 [hyper,130,1,132] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 0.17/0.46 144 [binary,143.1,2.1] {-} $F.
% 0.17/0.46
% 0.17/0.46 % SZS output end Refutation
% 0.17/0.46 ------------ end of proof -------------
% 0.17/0.46
% 0.17/0.46
% 0.17/0.46 Search stopped by max_proofs option.
% 0.17/0.46
% 0.17/0.46
% 0.17/0.46 Search stopped by max_proofs option.
% 0.17/0.46
% 0.17/0.46 ============ end of search ============
% 0.17/0.46
% 0.17/0.46 ----------- soft-scott stats ----------
% 0.17/0.46
% 0.17/0.46 true clauses given 11 (23.4%)
% 0.17/0.46 false clauses given 36
% 0.17/0.46
% 0.17/0.46 FALSE TRUE
% 0.17/0.46 12 2 4
% 0.17/0.46 14 1 9
% 0.17/0.46 16 2 5
% 0.17/0.46 18 8 3
% 0.17/0.46 20 10 5
% 0.17/0.46 22 3 2
% 0.17/0.46 24 1 4
% 0.17/0.46 26 0 2
% 0.17/0.46 28 1 4
% 0.17/0.46 30 2 0
% 0.17/0.46 36 3 0
% 0.17/0.46 40 6 3
% 0.17/0.46 44 0 1
% 0.17/0.46 52 0 1
% 0.17/0.46 56 1 0
% 0.17/0.46 tot: 40 43 (51.8% true)
% 0.17/0.46
% 0.17/0.46
% 0.17/0.46 Model 5 (0.00 seconds, 0 Inserts)
% 0.17/0.46
% 0.17/0.46 That finishes the proof of the theorem.
% 0.17/0.46
% 0.17/0.46 Process 14408 finished Mon Jul 4 22:19:05 2022
%------------------------------------------------------------------------------