TSTP Solution File: SET025-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET025-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:29 EDT 2022
% Result : Unsatisfiable 0.23s 0.42s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET025-3 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.15 % Command : sos-script %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sun Jul 10 12:57:02 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.42
% 0.23/0.42 -------- PROOF --------
% 0.23/0.42 % SZS status Unsatisfiable
% 0.23/0.42 % SZS output start Refutation
% 0.23/0.42 ----- Otter 3.2, August 2001 -----
% 0.23/0.42 The process was started by sandbox on n027.cluster.edu,
% 0.23/0.42 Sun Jul 10 12:57:03 2022
% 0.23/0.42 The command was "./sos". The process ID is 2122.
% 0.23/0.42
% 0.23/0.42 set(prolog_style_variables).
% 0.23/0.42 set(auto).
% 0.23/0.42 dependent: set(auto1).
% 0.23/0.42 dependent: set(process_input).
% 0.23/0.42 dependent: clear(print_kept).
% 0.23/0.42 dependent: clear(print_new_demod).
% 0.23/0.42 dependent: clear(print_back_demod).
% 0.23/0.42 dependent: clear(print_back_sub).
% 0.23/0.42 dependent: set(control_memory).
% 0.23/0.42 dependent: assign(max_mem, 12000).
% 0.23/0.42 dependent: assign(pick_given_ratio, 4).
% 0.23/0.42 dependent: assign(stats_level, 1).
% 0.23/0.42 dependent: assign(pick_semantic_ratio, 3).
% 0.23/0.42 dependent: assign(sos_limit, 5000).
% 0.23/0.42 dependent: assign(max_weight, 60).
% 0.23/0.42 clear(print_given).
% 0.23/0.42
% 0.23/0.42 list(usable).
% 0.23/0.42
% 0.23/0.42 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.23/0.42
% 0.23/0.42 This ia a non-Horn set with equality. The strategy will be
% 0.23/0.42 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.23/0.42 unit deletion, with positive clauses in sos and nonpositive
% 0.23/0.42 clauses in usable.
% 0.23/0.42
% 0.23/0.42 dependent: set(knuth_bendix).
% 0.23/0.42 dependent: set(para_from).
% 0.23/0.42 dependent: set(para_into).
% 0.23/0.42 dependent: clear(para_from_right).
% 0.23/0.42 dependent: clear(para_into_right).
% 0.23/0.42 dependent: set(para_from_vars).
% 0.23/0.42 dependent: set(eq_units_both_ways).
% 0.23/0.42 dependent: set(dynamic_demod_all).
% 0.23/0.42 dependent: set(dynamic_demod).
% 0.23/0.42 dependent: set(order_eq).
% 0.23/0.42 dependent: set(back_demod).
% 0.23/0.42 dependent: set(lrpo).
% 0.23/0.42 dependent: set(hyper_res).
% 0.23/0.42 dependent: set(unit_deletion).
% 0.23/0.42 dependent: set(factor).
% 0.23/0.42
% 0.23/0.42 ------------> process usable:
% 0.23/0.42
% 0.23/0.42 ------------> process sos:
% 0.23/0.42
% 0.23/0.42 ----> UNIT CONFLICT at 0.02 sec ----> 316 [binary,315.1,221.1] {-} $F.
% 0.23/0.42
% 0.23/0.42 Length of proof is 2. Level of proof is 2.
% 0.23/0.42
% 0.23/0.42 ---------------- PROOF ----------------
% 0.23/0.42 % SZS status Unsatisfiable
% 0.23/0.42 % SZS output start Refutation
% 0.23/0.42
% 0.23/0.42 139 [] {-} -little_set(ordered_pair(a,b)).
% 0.23/0.42 221 [] {-} little_set(non_ordered_pair(A,B)).
% 0.23/0.42 223,222 [] {-} singleton_set(A)=non_ordered_pair(A,A).
% 0.23/0.42 224 [] {-} ordered_pair(A,B)=non_ordered_pair(singleton_set(A),non_ordered_pair(A,B)).
% 0.23/0.42 226,225 [copy,224,demod,223] {-} ordered_pair(A,B)=non_ordered_pair(non_ordered_pair(A,A),non_ordered_pair(A,B)).
% 0.23/0.42 315 [back_demod,139,demod,226] {-} -little_set(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))).
% 0.23/0.42 316 [binary,315.1,221.1] {-} $F.
% 0.23/0.42
% 0.23/0.42 % SZS output end Refutation
% 0.23/0.42 ------------ end of proof -------------
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42 Search stopped by max_proofs option.
% 0.23/0.42
% 0.23/0.42
% 0.23/0.42 Search stopped by max_proofs option.
% 0.23/0.42
% 0.23/0.42 ============ end of search ============
% 0.23/0.42
% 0.23/0.42 That finishes the proof of the theorem.
% 0.23/0.42
% 0.23/0.42 Process 2122 finished Sun Jul 10 12:57:03 2022
%------------------------------------------------------------------------------