TSTP Solution File: SYN382+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN382+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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 : Thu Jul 21 12:12:22 EDT 2022
% Result : Theorem 0.21s 0.41s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN382+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 17:18:00 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n010.cluster.edu,
% 0.14/0.37 Mon Jul 11 17:18:00 2022
% 0.14/0.37 The command was "./sos". The process ID is 29419.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 formula_list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 0.14/0.37
% 0.14/0.37 This is a non-Horn set without equality. The strategy
% 0.14/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 2
% 0.21/0.41 number of clauses initially in problem: 3
% 0.21/0.41 percentage of clauses intially in UL: 66
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 75
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 4
% 0.21/0.41 distinct predicate count: 2
% 0.21/0.41 distinct function count: 1
% 0.21/0.41 distinct constant count: 1
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.21/0.41
% 0.21/0.41 -------- PROOF --------
% 0.21/0.41 % SZS status Theorem
% 0.21/0.41 % SZS output start Refutation
% 0.21/0.41
% 0.21/0.41 ----> UNIT CONFLICT at 0.01 sec ----> 5 [binary,4.1,1.1] {-} $F.
% 0.21/0.41
% 0.21/0.41 Length of proof is 1. Level of proof is 1.
% 0.21/0.41
% 0.21/0.41 ---------------- PROOF ----------------
% 0.21/0.41 % SZS status Theorem
% 0.21/0.41 % SZS output start Refutation
% 0.21/0.41
% 0.21/0.41 1 [] {+} -big_p(A,$c1).
% 0.21/0.41 2 [] {+} -big_q(A,$c1).
% 0.21/0.41 3 [] {-} big_p($f1(A),B)|big_q($f1(A),A).
% 0.21/0.41 4 [hyper,3,2] {-} big_p($f1($c1),A).
% 0.21/0.41 5 [binary,4.1,1.1] {-} $F.
% 0.21/0.41
% 0.21/0.41 % SZS output end Refutation
% 0.21/0.41 ------------ end of proof -------------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Search stopped by max_proofs option.
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Search stopped by max_proofs option.
% 0.21/0.41
% 0.21/0.41 ============ end of search ============
% 0.21/0.41
% 0.21/0.41 ----------- soft-scott stats ----------
% 0.21/0.41
% 0.21/0.41 true clauses given 0 (0.0%)
% 0.21/0.41 false clauses given 1
% 0.21/0.41
% 0.21/0.41 FALSE TRUE
% 0.21/0.41 tot: 0 0 (-nan% true)
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 That finishes the proof of the theorem.
% 0.21/0.41
% 0.21/0.41 Process 29419 finished Mon Jul 11 17:18:00 2022
%------------------------------------------------------------------------------