TSTP Solution File: LCL178-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL178-1 : TPTP v8.1.0. Released v1.1.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:22 EDT 2022
% Result : Unsatisfiable 0.47s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL178-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.14/0.33 % Computer : n025.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon Jul 4 02:31:11 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.14/0.35 Mon Jul 4 02:31:11 2022
% 0.14/0.35 The command was "./sos". The process ID is 26491.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.35
% 0.14/0.35 This is a Horn set without equality. The strategy will
% 0.14/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.35 in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: clear(order_hyper).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35
% 0.14/0.35 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 4
% 0.20/0.38 number of clauses initially in problem: 9
% 0.20/0.38 percentage of clauses intially in UL: 44
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 5
% 0.20/0.38 distinct predicate count: 2
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 1
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.47/0.63
% 0.47/0.63 -------- PROOF --------
% 0.47/0.63 % SZS status Unsatisfiable
% 0.47/0.63 % SZS output start Refutation
% 0.47/0.63
% 0.47/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.63
% 0.47/0.63 Stopped by limit on number of solutions
% 0.47/0.63
% 0.47/0.63 Model 4 (0.00 seconds, 0 Inserts)
% 0.47/0.63
% 0.47/0.63 Stopped by limit on number of solutions
% 0.47/0.63
% 0.47/0.63 Model 5 [ 1 1 4454 ] (0.00 seconds, 121275 Inserts)
% 0.47/0.63
% 0.47/0.63 Model 6 [ 2 5 26733 ] (0.00 seconds, 35912 Inserts)
% 0.47/0.63
% 0.47/0.63 ----> UNIT CONFLICT at 0.26 sec ----> 37 [binary,36.1,4.1] {+} $F.
% 0.47/0.63
% 0.47/0.63 Length of proof is 3. Level of proof is 3.
% 0.47/0.63
% 0.47/0.63 ---------------- PROOF ----------------
% 0.47/0.63 % SZS status Unsatisfiable
% 0.47/0.63 % SZS output start Refutation
% 0.47/0.63
% 0.47/0.63 1 [] {+} theorem(A)| -axiom(A).
% 0.47/0.63 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 0.47/0.63 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 0.47/0.63 4 [] {+} -theorem(or(not(p),not(not(p)))).
% 0.47/0.63 5 [] {+} axiom(or(not(or(A,A)),A)).
% 0.47/0.63 6 [] {+} axiom(or(not(A),or(B,A))).
% 0.47/0.63 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 0.47/0.63 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 0.47/0.63 30 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 0.47/0.63 36 [hyper,30,2,7] {-} theorem(or(A,not(A))).
% 0.47/0.63 37 [binary,36.1,4.1] {+} $F.
% 0.47/0.63
% 0.47/0.63 % SZS output end Refutation
% 0.47/0.63 ------------ end of proof -------------
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 Search stopped by max_proofs option.
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 Search stopped by max_proofs option.
% 0.47/0.63
% 0.47/0.63 ============ end of search ============
% 0.47/0.63
% 0.47/0.63 ----------- soft-scott stats ----------
% 0.47/0.63
% 0.47/0.63 true clauses given 1 (11.1%)
% 0.47/0.63 false clauses given 8
% 0.47/0.63
% 0.47/0.63 FALSE TRUE
% 0.47/0.63 7 2 1
% 0.47/0.63 9 3 4
% 0.47/0.63 11 2 1
% 0.47/0.63 13 4 1
% 0.47/0.63 15 1 1
% 0.47/0.63 tot: 12 8 (40.0% true)
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 Model 6 [ 2 5 26733 ] (0.00 seconds, 35912 Inserts)
% 0.47/0.63
% 0.47/0.63 That finishes the proof of the theorem.
% 0.47/0.63
% 0.47/0.63 Process 26491 finished Mon Jul 4 02:31:11 2022
%------------------------------------------------------------------------------