TSTP Solution File: NUN080+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUN080+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Mon Jul 18 16:38:33 EDT 2022
% Result : Theorem 2.26s 2.47s
% Output : Refutation 2.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUN080+1 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 2 05:57:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.35 Thu Jun 2 05:57:08 2022
% 0.13/0.35 The command was "./sos". The process ID is 9268.
% 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 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.13/0.35
% 0.13/0.35 This is a non-Horn set without equality. The strategy
% 0.13/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 42 back subsumes 36.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.18/0.40
% 0.18/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 -------------- Softie stats --------------
% 0.18/0.40
% 0.18/0.40 UPDATE_STOP: 300
% 0.18/0.40 SFINDER_TIME_LIMIT: 2
% 0.18/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.40 number of clauses in intial UL: 40
% 0.18/0.40 number of clauses initially in problem: 62
% 0.18/0.40 percentage of clauses intially in UL: 64
% 0.18/0.40 percentage of distinct symbols occuring in initial UL: 36
% 0.18/0.40 percent of all initial clauses that are short: 100
% 0.18/0.40 absolute distinct symbol count: 25
% 0.18/0.40 distinct predicate count: 5
% 0.18/0.40 distinct function count: 19
% 0.18/0.40 distinct constant count: 1
% 0.18/0.40
% 0.18/0.40 ---------- no more Softie stats ----------
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 =========== start of search ===========
% 2.26/2.47
% 2.26/2.47 -------- PROOF --------
% 2.26/2.47 % SZS status Theorem
% 2.26/2.47 % SZS output start Refutation
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 2 [ 1 1 358 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 3 [ 1 0 249 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 4 [ 1 1 397 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 5 [ 1 0 1832 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 6 [ 2 1 1260 ] (0.00 seconds, 1707 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 7 [ 5 1 1034 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 8 [ 17 0 2082 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 9 [ 18 1 2206 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 -----> EMPTY CLAUSE at 2.10 sec ----> 160 [hyper,45,21,78,44,72,66] {-} $F.
% 2.26/2.47
% 2.26/2.47 Length of proof is 4. Level of proof is 2.
% 2.26/2.47
% 2.26/2.47 ---------------- PROOF ----------------
% 2.26/2.47 % SZS status Theorem
% 2.26/2.47 % SZS output start Refutation
% 2.26/2.47
% 2.26/2.47 2 [] {+} r1(A)| -id(A,$c1).
% 2.26/2.47 4 [] {+} r2(A,B)| -id(B,$f1(A)).
% 2.26/2.47 9 [] {+} -id(A,B)|id(B,A).
% 2.26/2.47 12 [] {+} -id(A,B)| -r1(B)|r1(A).
% 2.26/2.47 21 [] {+} -id(A,B)| -r3(C,D,A)| -r2(E,D)| -r1(F)| -r2(F,E).
% 2.26/2.47 42 [] {-} id(A,A).
% 2.26/2.47 44 [] {-} r2(A,$f4(B,A)).
% 2.26/2.47 45 [] {+} r3(A,$f4(A,B),$f5(A,B)).
% 2.26/2.47 53 [] {-} id($f13(A),A).
% 2.26/2.47 66 [hyper,42,4] {-} r2(A,$f1(A)).
% 2.26/2.47 67 [hyper,42,2] {+} r1($c1).
% 2.26/2.47 72 [hyper,53,12,67] {+} r1($f13($c1)).
% 2.26/2.47 78 [hyper,53,9] {-} id(A,$f13(A)).
% 2.26/2.47 160 [hyper,45,21,78,44,72,66] {-} $F.
% 2.26/2.47
% 2.26/2.47 % SZS output end Refutation
% 2.26/2.47 ------------ end of proof -------------
% 2.26/2.47
% 2.26/2.47
% 2.26/2.47 Search stopped by max_proofs option.
% 2.26/2.47
% 2.26/2.47
% 2.26/2.47 Search stopped by max_proofs option.
% 2.26/2.47
% 2.26/2.47 ============ end of search ============
% 2.26/2.47
% 2.26/2.47 ----------- soft-scott stats ----------
% 2.26/2.47
% 2.26/2.47 true clauses given 2 (12.5%)
% 2.26/2.47 false clauses given 14
% 2.26/2.47
% 2.26/2.47 FALSE TRUE
% 2.26/2.47 3 0 1
% 2.26/2.47 4 0 8
% 2.26/2.47 5 9 5
% 2.26/2.47 6 30 2
% 2.26/2.47 7 23 1
% 2.26/2.47 8 10 2
% 2.26/2.47 9 7 0
% 2.26/2.47 10 4 0
% 2.26/2.47 tot: 83 19 (18.6% true)
% 2.26/2.47
% 2.26/2.47
% 2.26/2.47 Model 9 [ 18 1 2206 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 That finishes the proof of the theorem.
% 2.26/2.47
% 2.26/2.47 Process 9268 finished Thu Jun 2 05:57:10 2022
%------------------------------------------------------------------------------