TSTP Solution File: LCL214-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL214-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 1.40s 1.61s
% Output : Refutation 1.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL214-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n027.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 : Mon Jul 4 01:36:55 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 sandbox on n027.cluster.edu,
% 0.13/0.35 Mon Jul 4 01:36:55 2022
% 0.13/0.35 The command was "./sos". The process ID is 4266.
% 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=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 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
% 0.13/0.35 ======= 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: 4
% 0.20/0.40 number of clauses initially in problem: 9
% 0.20/0.40 percentage of clauses intially in UL: 44
% 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: 6
% 0.20/0.40 distinct predicate count: 2
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 2
% 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 ===========
% 1.40/1.61
% 1.40/1.61 -------- PROOF --------
% 1.40/1.61 % SZS status Unsatisfiable
% 1.40/1.61 % SZS output start Refutation
% 1.40/1.61
% 1.40/1.61 Model 3 (0.00 seconds, 0 Inserts)
% 1.40/1.61
% 1.40/1.61 Stopped by limit on number of solutions
% 1.40/1.61
% 1.40/1.61 Stopped by limit on insertions
% 1.40/1.61
% 1.40/1.61 Model 4 [ 1 3 7886 ] (0.00 seconds, 250000 Inserts)
% 1.40/1.61
% 1.40/1.61 Model 5 (0.00 seconds, 250000 Inserts)
% 1.40/1.61
% 1.40/1.61 Stopped by limit on number of solutions
% 1.40/1.61
% 1.40/1.61 Model 6 (0.00 seconds, 250000 Inserts)
% 1.40/1.61
% 1.40/1.61 Stopped by limit on number of solutions
% 1.40/1.61
% 1.40/1.61 Modelling stopped after 300 given clauses and 0.00 seconds
% 1.40/1.61
% 1.40/1.61
% 1.40/1.61 ----> UNIT CONFLICT at 1.23 sec ----> 2320 [binary,2319.1,4.1] {-} $F.
% 1.40/1.61
% 1.40/1.61 Length of proof is 5. Level of proof is 5.
% 1.40/1.61
% 1.40/1.61 ---------------- PROOF ----------------
% 1.40/1.61 % SZS status Unsatisfiable
% 1.40/1.61 % SZS output start Refutation
% 1.40/1.61
% 1.40/1.61 1 [] {+} theorem(A)| -axiom(A).
% 1.40/1.61 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.40/1.61 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.40/1.61 4 [] {+} -theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))).
% 1.40/1.61 5 [] {+} axiom(or(not(or(A,A)),A)).
% 1.40/1.61 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 1.40/1.61 8 [] {+} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.40/1.61 9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.40/1.61 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 1.40/1.61 51 [hyper,9,2,10] {+} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 1.40/1.61 646 [hyper,51,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 1.40/1.61 1367 [hyper,646,2,8] {-} theorem(or(not(or(A,B)),or(not(or(not(B),A)),A))).
% 1.40/1.61 2319 [hyper,1367,3,7] {-} theorem(or(not(or(A,B)),or(not(or(not(A),B)),B))).
% 1.40/1.61 2320 [binary,2319.1,4.1] {-} $F.
% 1.40/1.61
% 1.40/1.61 % SZS output end Refutation
% 1.40/1.61 ------------ end of proof -------------
% 1.40/1.61
% 1.40/1.61
% 1.40/1.61 Search stopped by max_proofs option.
% 1.40/1.61
% 1.40/1.61
% 1.40/1.61 Search stopped by max_proofs option.
% 1.40/1.61
% 1.40/1.61 ============ end of search ============
% 1.40/1.61
% 1.40/1.61 ----------- soft-scott stats ----------
% 1.40/1.61
% 1.40/1.61 true clauses given 128 (26.2%)
% 1.40/1.61 false clauses given 360
% 1.40/1.61
% 1.40/1.61 FALSE TRUE
% 1.40/1.61 11 0 125
% 1.40/1.61 12 0 1
% 1.40/1.61 13 68 144
% 1.40/1.61 14 4 7
% 1.40/1.61 15 355 76
% 1.40/1.61 16 7 8
% 1.40/1.61 17 280 54
% 1.40/1.61 18 24 6
% 1.40/1.61 19 172 25
% 1.40/1.61 20 31 4
% 1.40/1.61 21 105 16
% 1.40/1.61 22 20 3
% 1.40/1.61 23 72 3
% 1.40/1.61 24 7 1
% 1.40/1.61 25 38 0
% 1.40/1.61 26 12 0
% 1.40/1.61 27 12 1
% 1.40/1.61 28 13 0
% 1.40/1.61 29 5 0
% 1.40/1.61 31 6 0
% 1.40/1.61 32 1 0
% 1.40/1.61 33 10 0
% 1.40/1.61 35 1 0
% 1.40/1.61 36 3 0
% 1.40/1.61 37 3 0
% 1.40/1.61 38 2 0
% 1.40/1.61 39 1 0
% 1.40/1.61 41 1 0
% 1.40/1.61 47 3 0
% 1.40/1.61 49 2 0
% 1.40/1.61 tot: 1258 474 (27.4% true)
% 1.40/1.61
% 1.40/1.61
% 1.40/1.61 Model 6 (0.00 seconds, 250000 Inserts)
% 1.40/1.61
% 1.40/1.61 That finishes the proof of the theorem.
% 1.40/1.61
% 1.40/1.61 Process 4266 finished Mon Jul 4 01:36:56 2022
%------------------------------------------------------------------------------