TSTP Solution File: LCL033-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL033-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:28 EDT 2022
% Result : Unsatisfiable 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL033-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.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 : Sun Jul 3 10:17:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n007.cluster.edu,
% 0.20/0.36 Sun Jul 3 10:17:56 2022
% 0.20/0.36 The command was "./sos". The process ID is 962.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.20/0.36
% 0.20/0.36 This is a Horn set without equality. The strategy will
% 0.20/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.36 in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= 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: 80
% 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 ===========
% 0.20/0.47
% 0.20/0.47 -------- PROOF --------
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 ----> UNIT CONFLICT at 0.08 sec ----> 30 [binary,29.1,2.1] {-} $F.
% 0.20/0.47
% 0.20/0.47 Length of proof is 7. Level of proof is 7.
% 0.20/0.47
% 0.20/0.47 ---------------- PROOF ----------------
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.20/0.47 2 [] {+} -is_a_theorem(implies(a,implies(b,a))).
% 0.20/0.47 3 [] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),E),implies(implies(E,A),implies(C,A)))).
% 0.20/0.47 4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 0.20/0.47 6 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(falsehood,B)),C),implies(D,C))).
% 0.20/0.47 14 [hyper,6,1,6] {-} is_a_theorem(implies(A,implies(B,implies(falsehood,C)))).
% 0.20/0.47 23 [hyper,14,1,14] {+} is_a_theorem(implies(A,implies(falsehood,B))).
% 0.20/0.47 26 [hyper,23,1,3] {-} is_a_theorem(implies(implies(implies(falsehood,A),B),implies(C,B))).
% 0.20/0.47 28 [hyper,26,1,4] {-} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 0.20/0.47 29 [hyper,28,1,28] {-} is_a_theorem(implies(A,implies(B,A))).
% 0.20/0.47 30 [binary,29.1,2.1] {-} $F.
% 0.20/0.47
% 0.20/0.47 % SZS output end Refutation
% 0.20/0.47 ------------ end of proof -------------
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Search stopped by max_proofs option.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Search stopped by max_proofs option.
% 0.20/0.47
% 0.20/0.47 ============ end of search ============
% 0.20/0.47
% 0.20/0.47 ----------- soft-scott stats ----------
% 0.20/0.47
% 0.20/0.47 true clauses given 1 (8.3%)
% 0.20/0.47 false clauses given 11
% 0.20/0.47
% 0.20/0.47 FALSE TRUE
% 0.20/0.47 10 1 0
% 0.20/0.47 12 1 0
% 0.20/0.47 14 2 0
% 0.20/0.47 16 1 0
% 0.20/0.47 20 3 0
% 0.20/0.47 22 1 0
% 0.20/0.47 24 1 0
% 0.20/0.47 28 1 0
% 0.20/0.47 tot: 11 0 (0.0% true)
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 That finishes the proof of the theorem.
% 0.20/0.47
% 0.20/0.47 Process 962 finished Sun Jul 3 10:17:56 2022
%------------------------------------------------------------------------------