TSTP Solution File: KRS105+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS105+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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 03:29:46 EDT 2022
% Result : Unsatisfiable 0.38s 0.60s
% Output : Refutation 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS105+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 17:38:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n029.cluster.edu,
% 0.12/0.35 Tue Jun 7 17:38:20 2022
% 0.12/0.35 The command was "./sos". The process ID is 11146.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 11
% 0.18/0.37 number of clauses initially in problem: 16
% 0.18/0.37 percentage of clauses intially in UL: 68
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 80
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 15
% 0.18/0.37 distinct predicate count: 11
% 0.18/0.37 distinct function count: 3
% 0.18/0.37 distinct constant count: 1
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 0.38/0.60
% 0.38/0.60 -------- PROOF --------
% 0.38/0.60 % SZS status Theorem
% 0.38/0.60 % SZS output start Refutation
% 0.38/0.60
% 0.38/0.60 Model 2 (0.00 seconds, 0 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on number of solutions
% 0.38/0.60
% 0.38/0.60 Model 3 (0.00 seconds, 0 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on number of solutions
% 0.38/0.60
% 0.38/0.60 Model 4 (0.00 seconds, 0 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on number of solutions
% 0.38/0.60
% 0.38/0.60 Model 5 [ 1 1 231 ] (0.00 seconds, 699 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on insertions
% 0.38/0.60
% 0.38/0.60 Model 6 [ 1 0 73 ] (0.00 seconds, 250000 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on insertions
% 0.38/0.60
% 0.38/0.60 Model 7 [ 1 1 109 ] (0.00 seconds, 250000 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on insertions
% 0.38/0.60
% 0.38/0.60 Model 8 [ 2 1 22022 ] (0.00 seconds, 250000 Inserts)
% 0.38/0.60
% 0.38/0.60 -----> EMPTY CLAUSE at 0.23 sec ----> 26 [hyper,25,6,22] {-} $F.
% 0.38/0.60
% 0.38/0.60 Length of proof is 9. Level of proof is 6.
% 0.38/0.60
% 0.38/0.60 ---------------- PROOF ----------------
% 0.38/0.60 % SZS status Theorem
% 0.38/0.60 % SZS output start Refutation
% 0.38/0.60
% 0.38/0.60 3 [] {+} -cUnsatisfiable(A)|cdxcomp(A).
% 0.38/0.60 4 [] {+} -cUnsatisfiable(A)|cc(A).
% 0.38/0.60 5 [] {+} -cc(A)| -rr(A,B)|cc(B).
% 0.38/0.60 6 [] {+} -cd(A)| -ra_Px1(A,B).
% 0.38/0.60 7 [] {+} -cdxcomp(A)|ra_Px1(A,$f2(A)).
% 0.38/0.60 10 [] {+} ca_Ax2(A)| -cc($f3(A)).
% 0.38/0.60 11 [] {+} -ca_Ax2(A)|cd(A).
% 0.38/0.60 14 [] {+} cd(A)|ra_Px1(A,$f1(A)).
% 0.38/0.60 15 [] {+} ca_Ax2(A)|rr(A,$f3(A)).
% 0.38/0.60 16 [] {+} cUnsatisfiable(i2003_11_14_17_20_53634).
% 0.38/0.60 17 [hyper,16,4] {+} cc(i2003_11_14_17_20_53634).
% 0.38/0.60 18 [hyper,16,3] {+} cdxcomp(i2003_11_14_17_20_53634).
% 0.38/0.60 19 [hyper,15,11] {+} rr(A,$f3(A))|cd(A).
% 0.38/0.60 20 [hyper,18,7] {+} ra_Px1(i2003_11_14_17_20_53634,$f2(i2003_11_14_17_20_53634)).
% 0.38/0.60 21 [hyper,20,6,19] {+} rr(i2003_11_14_17_20_53634,$f3(i2003_11_14_17_20_53634)).
% 0.38/0.60 22 [hyper,20,6,14] {+} ra_Px1(i2003_11_14_17_20_53634,$f1(i2003_11_14_17_20_53634)).
% 0.38/0.60 23 [hyper,21,5,17] {+} cc($f3(i2003_11_14_17_20_53634)).
% 0.38/0.60 24 [hyper,23,10] {+} ca_Ax2(i2003_11_14_17_20_53634).
% 0.38/0.60 25 [hyper,24,11] {+} cd(i2003_11_14_17_20_53634).
% 0.38/0.60 26 [hyper,25,6,22] {-} $F.
% 0.38/0.60
% 0.38/0.60 % SZS output end Refutation
% 0.38/0.60 ------------ end of proof -------------
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Search stopped by max_proofs option.
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Search stopped by max_proofs option.
% 0.38/0.60
% 0.38/0.60 ============ end of search ============
% 0.38/0.60
% 0.38/0.60 ----------- soft-scott stats ----------
% 0.38/0.60
% 0.38/0.60 true clauses given 7 (50.0%)
% 0.38/0.60 false clauses given 7
% 0.38/0.60
% 0.38/0.60 FALSE TRUE
% 0.38/0.60 tot: 0 0 (-nan% true)
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Model 8 [ 2 1 22022 ] (0.00 seconds, 250000 Inserts)
% 0.38/0.60
% 0.38/0.60 That finishes the proof of the theorem.
% 0.38/0.60
% 0.38/0.60 Process 11146 finished Tue Jun 7 17:38:20 2022
%------------------------------------------------------------------------------