TSTP Solution File: LCL171-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL171-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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.05s 1.31s
% Output : Refutation 1.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL171-3 : TPTP v8.1.0. Released v2.3.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 23:32:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.18/0.35 Mon Jul 4 23:32:42 2022
% 0.18/0.35 The command was "./sos". The process ID is 28018.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.18/0.35
% 0.18/0.35 This is a Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.18/0.35 sos and nonpositive clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: clear(order_hyper).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 3
% 0.18/0.39 number of clauses initially in problem: 11
% 0.18/0.39 percentage of clauses intially in UL: 27
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 8
% 0.18/0.39 distinct predicate count: 3
% 0.18/0.39 distinct function count: 3
% 0.18/0.39 distinct constant count: 2
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 1.05/1.31
% 1.05/1.31 -------- PROOF --------
% 1.05/1.31 % SZS status Unsatisfiable
% 1.05/1.31 % SZS output start Refutation
% 1.05/1.31
% 1.05/1.31 Model 3 (0.00 seconds, 0 Inserts)
% 1.05/1.31
% 1.05/1.31 Stopped by limit on number of solutions
% 1.05/1.31
% 1.05/1.31 Model 4 (0.00 seconds, 0 Inserts)
% 1.05/1.31
% 1.05/1.31 Stopped by limit on number of solutions
% 1.05/1.31
% 1.05/1.31 Stopped by limit on insertions
% 1.05/1.31
% 1.05/1.31 Model 5 [ 21 0 106 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.31
% 1.05/1.31 Stopped by limit on insertions
% 1.05/1.31
% 1.05/1.31 Model 6 [ 1 1 5732 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.31
% 1.05/1.31 Stopped by limit on insertions
% 1.05/1.31
% 1.05/1.31 Model 7 [ 1 1 353 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.31
% 1.05/1.31 Stopped by limit on insertions
% 1.05/1.31
% 1.05/1.31 Stopped by limit on insertions
% 1.05/1.31
% 1.05/1.31 Model 8 [ 34 0 320 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.31
% 1.05/1.31 Stopped by limit on insertions
% 1.05/1.31
% 1.05/1.31 Model 9 [ 1 1 90 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.31
% 1.05/1.31 ----> UNIT CONFLICT at 0.95 sec ----> 46 [binary,45.1,3.1] {+} $F.
% 1.05/1.31
% 1.05/1.31 Length of proof is 4. Level of proof is 3.
% 1.05/1.31
% 1.05/1.31 ---------------- PROOF ----------------
% 1.05/1.31 % SZS status Unsatisfiable
% 1.05/1.31 % SZS output start Refutation
% 1.05/1.31
% 1.05/1.31 1 [] {+} theorem(A)| -axiom(A).
% 1.05/1.31 3 [] {+} -theorem(implies(implies(p,not(q)),implies(q,not(p)))).
% 1.05/1.31 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 1.05/1.31 9 [] {-} implies(A,B)=or(not(A),B).
% 1.05/1.31 10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 1.05/1.31 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 1.05/1.31 38 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 1.05/1.31 45 [para_into,38.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 1.05/1.31 46 [binary,45.1,3.1] {+} $F.
% 1.05/1.31
% 1.05/1.31 % SZS output end Refutation
% 1.05/1.31 ------------ end of proof -------------
% 1.05/1.31
% 1.05/1.31
% 1.05/1.31 Search stopped by max_proofs option.
% 1.05/1.31
% 1.05/1.31
% 1.05/1.31 Search stopped by max_proofs option.
% 1.05/1.31
% 1.05/1.31 ============ end of search ============
% 1.05/1.31
% 1.05/1.31 ----------- soft-scott stats ----------
% 1.05/1.31
% 1.05/1.31 true clauses given 6 (33.3%)
% 1.05/1.31 false clauses given 12
% 1.05/1.31
% 1.05/1.31 FALSE TRUE
% 1.05/1.31 8 0 6
% 1.05/1.31 9 0 1
% 1.05/1.31 10 1 6
% 1.05/1.31 12 0 5
% 1.05/1.31 tot: 1 18 (94.7% true)
% 1.05/1.31
% 1.05/1.31
% 1.05/1.31 Model 9 [ 1 1 90 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.31
% 1.05/1.31 That finishes the proof of the theorem.
% 1.05/1.31
% 1.05/1.31 Process 28018 finished Mon Jul 4 23:32:43 2022
%------------------------------------------------------------------------------