TSTP Solution File: LCL172-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL172-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:19 EDT 2022
% Result : Unsatisfiable 1.36s 1.54s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL172-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 00:18:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n018.cluster.edu,
% 0.12/0.36 Sun Jul 3 00:18:49 2022
% 0.12/0.36 The command was "./sos". The process ID is 31622.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 3
% 0.12/0.40 number of clauses initially in problem: 11
% 0.12/0.40 percentage of clauses intially in UL: 27
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 66
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 9
% 0.12/0.40 distinct predicate count: 3
% 0.12/0.40 distinct function count: 3
% 0.12/0.40 distinct constant count: 3
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 1.36/1.54
% 1.36/1.54 -------- PROOF --------
% 1.36/1.54 % SZS status Unsatisfiable
% 1.36/1.54 % SZS output start Refutation
% 1.36/1.54
% 1.36/1.54 Model 3 (0.00 seconds, 0 Inserts)
% 1.36/1.54
% 1.36/1.54 Stopped by limit on number of solutions
% 1.36/1.54
% 1.36/1.54 Model 4 (0.00 seconds, 0 Inserts)
% 1.36/1.54
% 1.36/1.54 Stopped by limit on number of solutions
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Model 5 [ 21 1 144 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Model 6 [ 1 4 69778 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Model 7 [ 30 1 23656 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Model 8 [ 1 3 40932 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Stopped by limit on insertions
% 1.36/1.54
% 1.36/1.54 Model 9 [ 1 9 221613 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54
% 1.36/1.54 ----> UNIT CONFLICT at 1.15 sec ----> 101 [binary,100.1,3.1] {+} $F.
% 1.36/1.54
% 1.36/1.54 Length of proof is 4. Level of proof is 3.
% 1.36/1.54
% 1.36/1.54 ---------------- PROOF ----------------
% 1.36/1.54 % SZS status Unsatisfiable
% 1.36/1.54 % SZS output start Refutation
% 1.36/1.54
% 1.36/1.54 1 [] {+} theorem(A)| -axiom(A).
% 1.36/1.54 3 [] {+} -theorem(implies(implies(p,implies(q,r)),implies(q,implies(p,r)))).
% 1.36/1.54 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.36/1.54 9 [] {-} implies(A,B)=or(not(A),B).
% 1.36/1.54 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 1.36/1.54 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.36/1.54 60 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 1.36/1.54 100 [para_into,60.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 1.36/1.54 101 [binary,100.1,3.1] {+} $F.
% 1.36/1.54
% 1.36/1.54 % SZS output end Refutation
% 1.36/1.54 ------------ end of proof -------------
% 1.36/1.54
% 1.36/1.54
% 1.36/1.54 Search stopped by max_proofs option.
% 1.36/1.54
% 1.36/1.54
% 1.36/1.54 Search stopped by max_proofs option.
% 1.36/1.54
% 1.36/1.54 ============ end of search ============
% 1.36/1.54
% 1.36/1.54 ----------- soft-scott stats ----------
% 1.36/1.54
% 1.36/1.54 true clauses given 8 (25.0%)
% 1.36/1.54 false clauses given 24
% 1.36/1.54
% 1.36/1.54 FALSE TRUE
% 1.36/1.54 8 0 6
% 1.36/1.54 9 0 8
% 1.36/1.54 10 0 9
% 1.36/1.54 11 0 3
% 1.36/1.54 12 3 6
% 1.36/1.54 13 6 3
% 1.36/1.54 14 4 2
% 1.36/1.54 tot: 13 37 (74.0% true)
% 1.36/1.54
% 1.36/1.54
% 1.36/1.54 Model 9 [ 1 9 221613 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54
% 1.36/1.54 That finishes the proof of the theorem.
% 1.36/1.54
% 1.36/1.54 Process 31622 finished Sun Jul 3 00:18:50 2022
%------------------------------------------------------------------------------