TSTP Solution File: LCL077-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL077-2 : 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:27:46 EDT 2022
% Result : Unsatisfiable 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 4 10:58:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n013.cluster.edu,
% 0.14/0.36 Mon Jul 4 10:58:59 2022
% 0.14/0.36 The command was "./sos". The process ID is 22069.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set without equality. The strategy will
% 0.14/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.36 in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 3
% 0.20/0.40 number of clauses initially in problem: 6
% 0.20/0.40 percentage of clauses intially in UL: 50
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 4
% 0.20/0.40 distinct predicate count: 1
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 1
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.20/0.43
% 0.20/0.43 -------- PROOF --------
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43 ----> UNIT CONFLICT at 0.03 sec ----> 244 [binary,243.1,3.1] {-} $F.
% 0.20/0.43
% 0.20/0.43 Length of proof is 8. Level of proof is 5.
% 0.20/0.43
% 0.20/0.43 ---------------- PROOF ----------------
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.20/0.43 2 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(implies(B,C))|is_a_theorem(implies(A,C)).
% 0.20/0.43 3 [] {+} -is_a_theorem(implies(not(not(a)),a)).
% 0.20/0.43 4 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.20/0.43 5 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 0.20/0.43 6 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 0.20/0.43 10 [hyper,6,2,4] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 0.20/0.43 13 [hyper,10,2,6] {+} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 0.20/0.43 41 [hyper,5,1,10] {-} is_a_theorem(implies(implies(not(A),A),implies(not(A),B))).
% 0.20/0.43 44 [hyper,5,1,4] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 0.20/0.43 48 [hyper,41,2,4] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 0.20/0.43 118 [hyper,13,1,5] {-} is_a_theorem(implies(implies(not(not(A)),B),implies(not(not(A)),A))).
% 0.20/0.43 157 [hyper,44,1,48] {+} is_a_theorem(implies(A,A)).
% 0.20/0.43 243 [hyper,118,1,157] {-} is_a_theorem(implies(not(not(A)),A)).
% 0.20/0.43 244 [binary,243.1,3.1] {-} $F.
% 0.20/0.43
% 0.20/0.43 % SZS output end Refutation
% 0.20/0.43 ------------ end of proof -------------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43 ============ end of search ============
% 0.20/0.43
% 0.20/0.43 ----------- soft-scott stats ----------
% 0.20/0.43
% 0.20/0.43 true clauses given 9 (28.1%)
% 0.20/0.43 false clauses given 23
% 0.20/0.43
% 0.20/0.43 FALSE TRUE
% 0.20/0.43 7 0 1
% 0.20/0.43 8 0 1
% 0.20/0.43 9 0 7
% 0.20/0.43 10 0 12
% 0.20/0.43 11 0 15
% 0.20/0.43 12 1 12
% 0.20/0.43 13 19 3
% 0.20/0.43 14 32 1
% 0.20/0.43 15 33 0
% 0.20/0.43 16 24 0
% 0.20/0.43 17 6 0
% 0.20/0.43 18 7 0
% 0.20/0.43 19 1 0
% 0.20/0.43 20 2 0
% 0.20/0.43 tot: 125 52 (29.4% true)
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 That finishes the proof of the theorem.
% 0.20/0.43
% 0.20/0.43 Process 22069 finished Mon Jul 4 10:58:59 2022
%------------------------------------------------------------------------------