TSTP Solution File: LCL230-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL230-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:54 EDT 2022
% Result : Unsatisfiable 10.12s 10.31s
% Output : Refutation 10.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL230-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n003.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 14:39:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n003.cluster.edu,
% 0.13/0.36 Mon Jul 4 14:39:55 2022
% 0.13/0.36 The command was "./sos". The process ID is 30824.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (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
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 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: 7
% 0.13/0.40 distinct predicate count: 2
% 0.13/0.40 distinct function count: 2
% 0.13/0.40 distinct constant count: 3
% 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 ===========
% 7.70/7.89
% 7.70/7.89
% 7.70/7.89 Changing weight limit from 60 to 40.
% 7.70/7.89
% 7.70/7.89 Stopped by limit on insertions
% 7.70/7.89
% 7.70/7.89 Model 3 (0.00 seconds, 0 Inserts)
% 7.70/7.89
% 7.70/7.89 Stopped by limit on number of solutions
% 7.70/7.89
% 7.70/7.89 Stopped by limit on insertions
% 7.70/7.89
% 7.70/7.89 Stopped by limit on insertions
% 7.70/7.89
% 7.70/7.89 Model 4 (0.00 seconds, 0 Inserts)
% 7.70/7.89
% 7.70/7.89 Stopped by limit on number of solutions
% 7.70/7.89
% 7.70/7.89 Modelling stopped after 300 given clauses and 0.00 seconds
% 7.70/7.89
% 7.70/7.89
% 7.70/7.89 Resetting weight limit to 40 after 1020 givens.
% 7.70/7.89
% 7.70/7.89
% 7.70/7.89
% 7.70/7.89 Changing weight limit from 40 to 36.
% 7.70/7.89
% 7.70/7.89 Resetting weight limit to 36 after 1025 givens.
% 7.70/7.89
% 7.70/7.90
% 7.70/7.90
% 7.70/7.90 Changing weight limit from 36 to 35.
% 7.70/7.90
% 7.70/7.90 Resetting weight limit to 35 after 1035 givens.
% 7.70/7.90
% 8.80/9.04
% 8.80/9.04
% 8.80/9.04 Changing weight limit from 35 to 32.
% 8.80/9.04
% 8.80/9.04 Resetting weight limit to 32 after 4510 givens.
% 8.80/9.04
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05 Changing weight limit from 32 to 30.
% 8.80/9.05
% 8.80/9.05 Resetting weight limit to 30 after 4530 givens.
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05 Changing weight limit from 30 to 29.
% 8.80/9.05
% 8.80/9.05 Resetting weight limit to 29 after 4535 givens.
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05 Changing weight limit from 29 to 27.
% 8.80/9.05
% 8.80/9.05 Resetting weight limit to 27 after 4550 givens.
% 8.80/9.05
% 8.88/9.06
% 8.88/9.06
% 8.88/9.06 Changing weight limit from 27 to 26.
% 8.88/9.06
% 8.88/9.06 Resetting weight limit to 26 after 4560 givens.
% 8.88/9.06
% 8.88/9.08
% 8.88/9.08
% 8.88/9.08 Changing weight limit from 26 to 25.
% 8.88/9.08
% 8.88/9.08 Resetting weight limit to 25 after 4630 givens.
% 8.88/9.08
% 8.88/9.09
% 8.88/9.09
% 8.88/9.09 Changing weight limit from 25 to 24.
% 8.88/9.09
% 8.88/9.09 Resetting weight limit to 24 after 4675 givens.
% 8.88/9.09
% 8.92/9.12
% 8.92/9.12
% 8.92/9.12 Changing weight limit from 24 to 23.
% 8.92/9.12
% 8.92/9.12 Resetting weight limit to 23 after 4780 givens.
% 8.92/9.12
% 8.96/9.16
% 8.96/9.16
% 8.96/9.16 Changing weight limit from 23 to 22.
% 8.96/9.16
% 8.96/9.16 Resetting weight limit to 22 after 4920 givens.
% 8.96/9.16
% 8.96/9.21
% 8.96/9.21
% 8.96/9.21 Changing weight limit from 22 to 21.
% 8.96/9.21
% 8.96/9.21 Resetting weight limit to 21 after 5105 givens.
% 8.96/9.21
% 9.12/9.33
% 9.12/9.33
% 9.12/9.33 Changing weight limit from 21 to 20.
% 9.12/9.33
% 9.12/9.33 Resetting weight limit to 20 after 5515 givens.
% 9.12/9.33
% 9.18/9.39
% 9.18/9.39
% 9.18/9.39 Changing weight limit from 20 to 19.
% 9.18/9.39
% 9.18/9.39 Resetting weight limit to 19 after 5750 givens.
% 9.18/9.39
% 9.60/9.84
% 9.60/9.84
% 9.60/9.84 Changing weight limit from 19 to 18.
% 9.60/9.84
% 9.60/9.84 Resetting weight limit to 18 after 7570 givens.
% 9.60/9.84
% 9.74/9.96
% 9.74/9.96
% 9.74/9.96 Changing weight limit from 18 to 17.
% 9.74/9.96
% 9.74/9.96 Resetting weight limit to 17 after 8120 givens.
% 9.74/9.96
% 10.12/10.31
% 10.12/10.31 -------- PROOF --------
% 10.12/10.31 % SZS status Unsatisfiable
% 10.12/10.31 % SZS output start Refutation
% 10.12/10.31
% 10.12/10.31 ----> UNIT CONFLICT at 9.88 sec ----> 30231 [binary,30230.1,4.1] {-} $F.
% 10.12/10.31
% 10.12/10.31 Length of proof is 7. Level of proof is 7.
% 10.12/10.31
% 10.12/10.31 ---------------- PROOF ----------------
% 10.12/10.31 % SZS status Unsatisfiable
% 10.12/10.31 % SZS output start Refutation
% 10.12/10.31
% 10.12/10.31 1 [] {+} theorem(A)| -axiom(A).
% 10.12/10.31 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 10.12/10.31 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 10.12/10.31 4 [] {+} -theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))).
% 10.12/10.31 5 [] {+} axiom(or(not(or(A,A)),A)).
% 10.12/10.31 6 [] {-} axiom(or(not(A),or(B,A))).
% 10.12/10.31 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 10.12/10.31 9 [] {+} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 10.12/10.31 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 10.12/10.31 33 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 10.12/10.31 59 [hyper,33,2,8] {-} theorem(or(A,or(not(or(A,B)),B))).
% 10.12/10.31 85 [hyper,59,3,6] {+} theorem(or(not(A),or(not(or(not(or(B,A)),C)),C))).
% 10.12/10.31 1032 [hyper,85,2,8] {+} theorem(or(not(or(not(or(A,B)),C)),or(not(B),C))).
% 10.12/10.31 8226 [hyper,1032,2,9] {+} theorem(or(not(or(A,or(not(or(B,C)),D))),or(A,or(not(C),D)))).
% 10.12/10.31 30230 [hyper,8226,3,8] {-} theorem(or(not(or(not(or(A,B)),or(C,D))),or(C,or(not(B),D)))).
% 10.12/10.31 30231 [binary,30230.1,4.1] {-} $F.
% 10.12/10.31
% 10.12/10.31 % SZS output end Refutation
% 10.12/10.31 ------------ end of proof -------------
% 10.12/10.31
% 10.12/10.31
% 10.12/10.31 Search stopped by max_proofs option.
% 10.12/10.31
% 10.12/10.31
% 10.12/10.31 Search stopped by max_proofs option.
% 10.12/10.31
% 10.12/10.31 ============ end of search ============
% 10.12/10.31
% 10.12/10.31 ----------- soft-scott stats ----------
% 10.12/10.31
% 10.12/10.31 true clauses given 2372 (24.3%)
% 10.12/10.31 false clauses given 7389
% 10.12/10.31
% 10.12/10.31 FALSE TRUE
% 10.12/10.31 15 504 2042
% 10.12/10.31 16 80 144
% 10.12/10.31 17 1920 314
% 10.12/10.31 tot: 2504 2500 (50.0% true)
% 10.12/10.31
% 10.12/10.31
% 10.12/10.31 Model 4 (0.00 seconds, 0 Inserts)
% 10.12/10.31
% 10.12/10.31 That finishes the proof of the theorem.
% 10.12/10.31
% 10.12/10.31 Process 30824 finished Mon Jul 4 14:40:05 2022
%------------------------------------------------------------------------------