TSTP Solution File: LCL436-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL436-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 14:30:13 EDT 2022
% Result : Unsatisfiable 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL436-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.11 % Command : sos-script %s
% 0.12/0.32 % Computer : n023.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 15:41:27 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n023.cluster.edu,
% 0.12/0.34 Mon Jul 4 15:41:27 2022
% 0.12/0.34 The command was "./sos". The process ID is 12836.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 0.12/0.34
% 0.12/0.34 This is a Horn set without equality. The strategy will
% 0.12/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34 in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.36
% 0.12/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.36
% 0.12/0.36 Stopped by limit on number of solutions
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 -------------- Softie stats --------------
% 0.12/0.36
% 0.12/0.36 UPDATE_STOP: 300
% 0.12/0.36 SFINDER_TIME_LIMIT: 2
% 0.12/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.36 number of clauses in intial UL: 2
% 0.12/0.36 number of clauses initially in problem: 3
% 0.12/0.36 percentage of clauses intially in UL: 66
% 0.12/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.36 percent of all initial clauses that are short: 100
% 0.12/0.36 absolute distinct symbol count: 10
% 0.12/0.36 distinct predicate count: 1
% 0.12/0.36 distinct function count: 3
% 0.12/0.36 distinct constant count: 6
% 0.12/0.36
% 0.12/0.36 ---------- no more Softie stats ----------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 =========== start of search ===========
% 0.12/0.36
% 0.12/0.36 -------- PROOF --------
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output start Refutation
% 0.12/0.36
% 0.12/0.36 ----> UNIT CONFLICT at 0.00 sec ----> 5 [binary,4.1,1.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 Length of proof is 1. Level of proof is 1.
% 0.12/0.36
% 0.12/0.36 ---------------- PROOF ----------------
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output start Refutation
% 0.12/0.36
% 0.12/0.36 1 [] {+} -c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_r,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(v_pa,v_r,t_a),t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)).
% 0.12/0.36 2 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(c_PropLog_Opl_Oop_A_N_62(D,A,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 0.12/0.36 3 [] {-} c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(B,C,D),D),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,B,D),c_PropLog_Opl_Oop_A_N_62(A,C,D),D),D),c_PropLog_Othms(E,D),tc_PropLog_Opl(D)).
% 0.12/0.36 4 [hyper,3,2] {-} c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(B,c_PropLog_Opl_Oop_A_N_62(C,D,E),E),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(B,C,E),c_PropLog_Opl_Oop_A_N_62(B,D,E),E),E),E),c_PropLog_Othms(F,E),tc_PropLog_Opl(E)).
% 0.12/0.36 5 [binary,4.1,1.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 % SZS output end Refutation
% 0.12/0.36 ------------ end of proof -------------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36 ============ end of search ============
% 0.12/0.36
% 0.12/0.36 ----------- soft-scott stats ----------
% 0.12/0.36
% 0.12/0.36 true clauses given 0 (0.0%)
% 0.12/0.36 false clauses given 1
% 0.12/0.36
% 0.12/0.36 FALSE TRUE
% 0.12/0.36 tot: 0 0 (-nan% true)
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.36
% 0.12/0.36 That finishes the proof of the theorem.
% 0.12/0.36
% 0.12/0.36 Process 12836 finished Mon Jul 4 15:41:27 2022
%------------------------------------------------------------------------------