TSTP Solution File: SET047-5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET047-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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 : Tue Jul 19 05:14:54 EDT 2022
% Result : Unsatisfiable 0.76s 0.95s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET047-5 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.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 : Sun Jul 10 00:36:44 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 n013.cluster.edu,
% 0.13/0.36 Sun Jul 10 00:36:44 2022
% 0.13/0.36 The command was "./sos". The process ID is 19952.
% 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=0, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 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.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 5
% 0.19/0.40 number of clauses initially in problem: 8
% 0.19/0.40 percentage of clauses intially in UL: 62
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 5
% 0.19/0.40 distinct predicate count: 2
% 0.19/0.40 distinct function count: 1
% 0.19/0.40 distinct constant count: 2
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.76/0.95
% 0.76/0.95 -------- PROOF --------
% 0.76/0.95 % SZS status Unsatisfiable
% 0.76/0.95 % SZS output start Refutation
% 0.76/0.95
% 0.76/0.95 Model 3 [ 1 2 22186 ] (0.00 seconds, 31004 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 4 [ 1 8 152659 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 5 [ 3 5 175684 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 6 [ 3 10 238860 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 7 [ 3 10 214466 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 8 [ 4 5 122002 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 -----> EMPTY CLAUSE at 0.57 sec ----> 107 [hyper,97,4,86] {-} $F.
% 0.76/0.95
% 0.76/0.95 Length of proof is 19. Level of proof is 10.
% 0.76/0.95
% 0.76/0.95 ---------------- PROOF ----------------
% 0.76/0.95 % SZS status Unsatisfiable
% 0.76/0.95 % SZS output start Refutation
% 0.76/0.95
% 0.76/0.95 1 [] {+} -set_equal(A,B)| -element(C,A)|element(C,B).
% 0.76/0.95 2 [] {+} -set_equal(A,B)| -element(C,B)|element(C,A).
% 0.76/0.95 3 [] {+} -element(f(A,B),B)| -element(f(A,B),A)|set_equal(A,B).
% 0.76/0.95 4 [] {+} -set_equal(b,a)| -set_equal(a,b).
% 0.76/0.95 6 [] {+} element(f(A,B),A)|element(f(A,B),B)|set_equal(A,B).
% 0.76/0.95 7 [] {+} set_equal(a,b)|set_equal(b,a).
% 0.76/0.95 9 [hyper,6,4,6] {-} element(f(a,b),a)|element(f(a,b),b)|element(f(b,a),b)|element(f(b,a),a).
% 0.76/0.95 11 [hyper,9,2,6,factor_simp,factor_simp,factor_simp] {-} element(f(a,b),b)|element(f(b,a),b)|element(f(b,a),a).
% 0.76/0.95 14 [hyper,9,1,6,factor_simp,factor_simp,factor_simp] {-} element(f(a,b),a)|element(f(b,a),b)|element(f(b,a),a).
% 0.76/0.95 22 [hyper,11,2,7,factor_simp] {-} element(f(a,b),b)|element(f(b,a),a)|set_equal(b,a).
% 0.76/0.95 28 [hyper,11,1,7,factor_simp] {-} element(f(a,b),b)|element(f(b,a),b)|set_equal(b,a).
% 0.76/0.95 30 [hyper,14,3,11,factor_simp,factor_simp] {+} element(f(b,a),b)|element(f(b,a),a)|set_equal(a,b).
% 0.76/0.95 41 [hyper,22,1,11,factor_simp,factor_simp,factor_simp] {-} element(f(a,b),b)|element(f(b,a),a).
% 0.76/0.95 46 [hyper,28,2,41,factor_simp,factor_simp] {-} element(f(a,b),b)|element(f(b,a),b).
% 0.76/0.95 49 [hyper,46,3,41,factor_simp] {-} element(f(a,b),b)|set_equal(b,a).
% 0.76/0.95 52 [hyper,30,4,6,factor_simp,factor_simp] {-} element(f(b,a),b)|element(f(b,a),a).
% 0.76/0.95 53 [hyper,49,4,6,factor_simp] {-} element(f(a,b),b)|element(f(a,b),a).
% 0.76/0.95 54 [hyper,52,2,7,factor_simp] {-} element(f(b,a),a)|set_equal(b,a).
% 0.76/0.95 58 [hyper,52,2,7,factor_simp] {+} element(f(b,a),b)|set_equal(a,b).
% 0.76/0.95 62 [hyper,54,1,52,factor_simp,factor_simp] {+} element(f(b,a),a).
% 0.76/0.95 78 [hyper,58,1,62,factor_simp] {+} element(f(b,a),b).
% 0.76/0.95 83 [hyper,53,2,49,factor_simp,factor_simp] {+} element(f(a,b),b).
% 0.76/0.95 86 [hyper,78,3,62] {+} set_equal(b,a).
% 0.76/0.95 96 [hyper,86,1,83] {+} element(f(a,b),a).
% 0.76/0.95 97 [hyper,96,3,83] {+} set_equal(a,b).
% 0.76/0.95 107 [hyper,97,4,86] {-} $F.
% 0.76/0.95
% 0.76/0.95 % SZS output end Refutation
% 0.76/0.95 ------------ end of proof -------------
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Search stopped by max_proofs option.
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Search stopped by max_proofs option.
% 0.76/0.95
% 0.76/0.95 ============ end of search ============
% 0.76/0.95
% 0.76/0.95 ----------- soft-scott stats ----------
% 0.76/0.95
% 0.76/0.95 true clauses given 5 (20.0%)
% 0.76/0.95 false clauses given 20
% 0.76/0.95
% 0.76/0.95 FALSE TRUE
% 0.76/0.95 15 4 4
% 0.76/0.95 25 12 0
% 0.76/0.95 tot: 16 4 (20.0% true)
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Model 8 [ 4 5 122002 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 That finishes the proof of the theorem.
% 0.76/0.95
% 0.76/0.95 Process 19952 finished Sun Jul 10 00:36:45 2022
%------------------------------------------------------------------------------