TSTP Solution File: SET027+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET027+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:32 EDT 2022
% Result : Theorem 0.42s 0.59s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET027+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n028.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 04:51:57 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 n028.cluster.edu,
% 0.13/0.36 Sun Jul 10 04:51:57 2022
% 0.13/0.36 The command was "./sos". The process ID is 31657.
% 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 formula_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.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 3
% 0.20/0.40 number of clauses initially in problem: 7
% 0.20/0.40 percentage of clauses intially in UL: 42
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 6
% 0.20/0.40 distinct predicate count: 2
% 0.20/0.40 distinct function count: 1
% 0.20/0.40 distinct constant count: 3
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.42/0.59
% 0.42/0.59 -------- PROOF --------
% 0.42/0.59 % SZS status Theorem
% 0.42/0.59 % SZS output start Refutation
% 0.42/0.59
% 0.42/0.59 Model 3 (0.00 seconds, 0 Inserts)
% 0.42/0.59
% 0.42/0.59 Stopped by limit on number of solutions
% 0.42/0.59
% 0.42/0.59 Model 4 [ 1 1 1240 ] (0.00 seconds, 236940 Inserts)
% 0.42/0.59
% 0.42/0.59 Stopped by limit on insertions
% 0.42/0.59
% 0.42/0.59 Model 5 [ 1 1 1208 ] (0.00 seconds, 250000 Inserts)
% 0.42/0.59
% 0.42/0.59 ----> UNIT CONFLICT at 0.21 sec ----> 14 [binary,13.1,3.1] {-} $F.
% 0.42/0.59
% 0.42/0.59 Length of proof is 4. Level of proof is 4.
% 0.42/0.59
% 0.42/0.59 ---------------- PROOF ----------------
% 0.42/0.59 % SZS status Theorem
% 0.42/0.59 % SZS output start Refutation
% 0.42/0.59
% 0.42/0.59 1 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 0.42/0.59 2 [] {+} subset(A,B)| -member($f1(A,B),B).
% 0.42/0.59 3 [] {+} -subset($c3,$c1).
% 0.42/0.59 4 [] {+} subset(A,B)|member($f1(A,B),A).
% 0.42/0.59 6 [] {+} subset($c3,$c2).
% 0.42/0.59 7 [] {+} subset($c2,$c1).
% 0.42/0.59 8 [hyper,4,3] {+} member($f1($c3,$c1),$c3).
% 0.42/0.59 9 [hyper,8,1,6] {-} member($f1($c3,$c1),$c2).
% 0.42/0.59 11 [hyper,9,1,7] {-} member($f1($c3,$c1),$c1).
% 0.42/0.59 13 [hyper,11,2] {-} subset($c3,$c1).
% 0.42/0.59 14 [binary,13.1,3.1] {-} $F.
% 0.42/0.59
% 0.42/0.59 % SZS output end Refutation
% 0.42/0.59 ------------ end of proof -------------
% 0.42/0.59
% 0.42/0.59
% 0.42/0.59 Search stopped by max_proofs option.
% 0.42/0.59
% 0.42/0.59
% 0.42/0.59 Search stopped by max_proofs option.
% 0.42/0.59
% 0.42/0.59 ============ end of search ============
% 0.42/0.59
% 0.42/0.59 ----------- soft-scott stats ----------
% 0.42/0.59
% 0.42/0.59 true clauses given 1 (14.3%)
% 0.42/0.59 false clauses given 6
% 0.42/0.59
% 0.42/0.59 FALSE TRUE
% 0.42/0.59 10 1 1
% 0.42/0.59 tot: 1 1 (50.0% true)
% 0.42/0.59
% 0.42/0.59
% 0.42/0.59 Model 5 [ 1 -5 1208 ] (0.00 seconds, 250000 Inserts)
% 0.42/0.59
% 0.42/0.59 That finishes the proof of the theorem.
% 0.42/0.59
% 0.42/0.59 Process 31657 finished Sun Jul 10 04:51:57 2022
%------------------------------------------------------------------------------