TSTP Solution File: LCL238-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL238-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:29:00 EDT 2022
% Result : Unsatisfiable 2.53s 2.78s
% Output : Refutation 2.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL238-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.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 23:38:57 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 n017.cluster.edu,
% 0.13/0.35 Mon Jul 4 23:38:57 2022
% 0.13/0.35 The command was "./sos". The process ID is 29803.
% 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.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.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 4
% 0.13/0.40 number of clauses initially in problem: 9
% 0.13/0.40 percentage of clauses intially in UL: 44
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 6
% 0.13/0.40 distinct predicate count: 2
% 0.13/0.40 distinct function count: 2
% 0.13/0.40 distinct constant count: 2
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 2.53/2.78
% 2.53/2.78 -------- PROOF --------
% 2.53/2.78 % SZS status Unsatisfiable
% 2.53/2.78 % SZS output start Refutation
% 2.53/2.78
% 2.53/2.78 Model 3 (0.00 seconds, 0 Inserts)
% 2.53/2.78
% 2.53/2.78 Stopped by limit on number of solutions
% 2.53/2.78
% 2.53/2.78 Model 4 (0.00 seconds, 0 Inserts)
% 2.53/2.78
% 2.53/2.78 Stopped by limit on number of solutions
% 2.53/2.78
% 2.53/2.78 Stopped by limit on insertions
% 2.53/2.78
% 2.53/2.78 Model 5 [ 12 1 327 ] (0.00 seconds, 250000 Inserts)
% 2.53/2.78
% 2.53/2.78 Stopped by limit on insertions
% 2.53/2.78
% 2.53/2.78 Model 6 [ 1 1 111 ] (0.00 seconds, 250000 Inserts)
% 2.53/2.78
% 2.53/2.78 Stopped by limit on insertions
% 2.53/2.78
% 2.53/2.78 Model 7 [ 1 5 44776 ] (0.00 seconds, 250000 Inserts)
% 2.53/2.78
% 2.53/2.78 ----> UNIT CONFLICT at 2.40 sec ----> 82 [binary,81.1,4.1] {+} $F.
% 2.53/2.78
% 2.53/2.78 Length of proof is 5. Level of proof is 5.
% 2.53/2.78
% 2.53/2.78 ---------------- PROOF ----------------
% 2.53/2.78 % SZS status Unsatisfiable
% 2.53/2.78 % SZS output start Refutation
% 2.53/2.78
% 2.53/2.78 1 [] {+} theorem(A)| -axiom(A).
% 2.53/2.78 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 2.53/2.78 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 2.53/2.78 4 [] {+} -theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))).
% 2.53/2.78 5 [] {+} axiom(or(not(or(A,A)),A)).
% 2.53/2.78 6 [] {+} axiom(or(not(A),or(B,A))).
% 2.53/2.78 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 2.53/2.78 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 2.53/2.78 30 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 2.53/2.78 36 [hyper,30,2,7] {+} theorem(or(A,not(A))).
% 2.53/2.78 62 [hyper,36,3,7] {-} theorem(or(not(or(A,B)),not(not(or(B,A))))).
% 2.53/2.78 81 [hyper,62,2,7] {-} theorem(or(not(not(or(A,B))),not(or(B,A)))).
% 2.53/2.78 82 [binary,81.1,4.1] {+} $F.
% 2.53/2.78
% 2.53/2.78 % SZS output end Refutation
% 2.53/2.78 ------------ end of proof -------------
% 2.53/2.78
% 2.53/2.78
% 2.53/2.78 Search stopped by max_proofs option.
% 2.53/2.78
% 2.53/2.78
% 2.53/2.78 Search stopped by max_proofs option.
% 2.53/2.78
% 2.53/2.78 ============ end of search ============
% 2.53/2.78
% 2.53/2.78 ----------- soft-scott stats ----------
% 2.53/2.78
% 2.53/2.78 true clauses given 2 (13.3%)
% 2.53/2.78 false clauses given 13
% 2.53/2.78
% 2.53/2.78 FALSE TRUE
% 2.53/2.78 7 0 5
% 2.53/2.78 9 0 11
% 2.53/2.78 11 2 8
% 2.53/2.78 13 5 7
% 2.53/2.78 15 4 3
% 2.53/2.78 17 4 2
% 2.53/2.78 19 2 1
% 2.53/2.78 21 1 0
% 2.53/2.78 tot: 18 37 (67.3% true)
% 2.53/2.78
% 2.53/2.78
% 2.53/2.78 Model 7 [ 1 5 44776 ] (0.00 seconds, 250000 Inserts)
% 2.53/2.78
% 2.53/2.78 That finishes the proof of the theorem.
% 2.53/2.78
% 2.53/2.78 Process 29803 finished Mon Jul 4 23:39:00 2022
%------------------------------------------------------------------------------