TSTP Solution File: LCL212-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL212-3 : TPTP v8.1.0. Released v2.3.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:28:44 EDT 2022
% Result : Unsatisfiable 3.34s 3.55s
% Output : Refutation 3.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL212-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 05:57:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n007.cluster.edu,
% 0.13/0.35 Mon Jul 4 05:57:56 2022
% 0.13/0.35 The command was "./sos". The process ID is 25858.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= 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: 3
% 0.13/0.39 number of clauses initially in problem: 11
% 0.13/0.39 percentage of clauses intially in UL: 27
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 8
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 3
% 0.13/0.39 distinct constant count: 2
% 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 Model 2 (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 =========== start of search ===========
% 3.34/3.55
% 3.34/3.55 -------- PROOF --------
% 3.34/3.55 % SZS status Unsatisfiable
% 3.34/3.55 % SZS output start Refutation
% 3.34/3.55
% 3.34/3.55 Stopped by limit on insertions
% 3.34/3.55
% 3.34/3.55 Stopped by limit on insertions
% 3.34/3.55
% 3.34/3.55 Model 3 (0.00 seconds, 0 Inserts)
% 3.34/3.55
% 3.34/3.55 Stopped by limit on number of solutions
% 3.34/3.55
% 3.34/3.55 Stopped by limit on insertions
% 3.34/3.55
% 3.34/3.55 Model 4 [ 30 0 134 ] (0.00 seconds, 250000 Inserts)
% 3.34/3.55
% 3.34/3.55 Stopped by limit on insertions
% 3.34/3.55
% 3.34/3.55 Model 5 [ 24 5 103830 ] (0.00 seconds, 250000 Inserts)
% 3.34/3.55
% 3.34/3.55 Stopped by limit on insertions
% 3.34/3.55
% 3.34/3.55 ----> UNIT CONFLICT at 3.17 sec ----> 28 [binary,27.1,3.1] {+} $F.
% 3.34/3.55
% 3.34/3.55 Length of proof is 4. Level of proof is 3.
% 3.34/3.55
% 3.34/3.55 ---------------- PROOF ----------------
% 3.34/3.55 % SZS status Unsatisfiable
% 3.34/3.55 % SZS output start Refutation
% 3.34/3.55
% 3.34/3.55 1 [] {+} theorem(A)| -axiom(A).
% 3.34/3.55 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 3.34/3.55 3 [] {+} -theorem(implies(not(p),implies(q,implies(implies(p,q),q)))).
% 3.34/3.55 5 [] {-} axiom(implies(A,or(B,A))).
% 3.34/3.55 9 [] {-} implies(A,B)=or(not(A),B).
% 3.34/3.55 10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 3.34/3.55 14 [hyper,5,1] {-} theorem(implies(A,or(B,A))).
% 3.34/3.55 22 [para_from,10.1.1,14.1.1.2] {-} theorem(implies(A,implies(B,A))).
% 3.34/3.55 27 [hyper,22,2,22] {-} theorem(implies(A,implies(B,implies(C,B)))).
% 3.34/3.55 28 [binary,27.1,3.1] {+} $F.
% 3.34/3.55
% 3.34/3.55 % SZS output end Refutation
% 3.34/3.55 ------------ end of proof -------------
% 3.34/3.55
% 3.34/3.55
% 3.34/3.55 Search stopped by max_proofs option.
% 3.34/3.55
% 3.34/3.55
% 3.34/3.55 Search stopped by max_proofs option.
% 3.34/3.55
% 3.34/3.55 ============ end of search ============
% 3.34/3.55
% 3.34/3.55 ----------- soft-scott stats ----------
% 3.34/3.55
% 3.34/3.55 true clauses given 1 (11.1%)
% 3.34/3.55 false clauses given 8
% 3.34/3.55
% 3.34/3.55 FALSE TRUE
% 3.34/3.55 6 1 0
% 3.34/3.55 8 4 1
% 3.34/3.55 9 2 0
% 3.34/3.55 12 4 0
% 3.34/3.55 tot: 11 1 (8.3% true)
% 3.34/3.55
% 3.34/3.55
% 3.34/3.55 Model 5 [ 24 -8 103830 ] (0.00 seconds, 250000 Inserts)
% 3.34/3.55
% 3.34/3.55 That finishes the proof of the theorem.
% 3.34/3.55
% 3.34/3.55 Process 25858 finished Mon Jul 4 05:58:00 2022
%------------------------------------------------------------------------------