TSTP Solution File: SWV001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %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 : Wed Jul 20 21:10:10 EDT 2022
% Result : Unsatisfiable 0.46s 1.01s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 23:26:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 5719 was started by sandbox on n028.cluster.edu,
% 0.46/1.00 Tue Jun 14 23:26:55 2022
% 0.46/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5566_n028.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_5566_n028.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (14 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00
% 0.46/1.00 ============================== end of process non-clausal formulas ===
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.00
% 0.46/1.00 ============================== PREDICATE ELIMINATION =================
% 0.46/1.00 1 -q1(A,B,C) | -less_or_equalish(A,B) | q2(A,B,C) # label(clause_1) # label(axiom). [assumption].
% 0.46/1.00 2 q1(a,b,c) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.46/1.00 Derived: -less_or_equalish(a,b) | q2(a,b,c). [resolve(1,a,2,a)].
% 0.46/1.00 3 -q1(A,B,C) | less_or_equalish(A,B) | q3(A,B,C) # label(clause_2) # label(axiom). [assumption].
% 0.46/1.00 Derived: less_or_equalish(a,b) | q3(a,b,c). [resolve(3,a,2,a)].
% 0.46/1.00 4 -q2(A,B,C) | q4(A,B,B) # label(clause_3) # label(axiom). [assumption].
% 0.46/1.00 5 -q4(a,b,A) | -less_or_equalish(a,A) | -less_or_equalish(b,A) | -less_or_equalish(A,a) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.46/1.00 6 -q4(a,b,A) | -less_or_equalish(a,A) | -less_or_equalish(b,A) | -less_or_equalish(A,b) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.46/1.00 Derived: -q2(a,b,A) | -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,a). [resolve(4,b,5,a)].
% 0.46/1.00 Derived: -q2(a,b,A) | -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,b). [resolve(4,b,6,a)].
% 0.46/1.00 7 -q3(A,B,C) | q4(A,B,A) # label(clause_4) # label(axiom). [assumption].
% 0.46/1.00 Derived: -q3(a,b,A) | -less_or_equalish(a,a) | -less_or_equalish(b,a) | -less_or_equalish(a,a). [resolve(7,b,5,a)].
% 0.46/1.00 8 -less_or_equalish(A,B) | -less_or_equalish(B,A) | equalish(A,B) # label(less_or_equal_implies_equal) # label(axiom). [assumption].
% 0.46/1.00 9 less_or_equalish(A,B) | -equalish(A,B) # label(equal_implies_less_or_equal) # label(axiom). [assumption].
% 0.46/1.00 10 -equalish(A,B) | -less_or_equalish(A,C) | less_or_equalish(B,C) # label(less_or_equal_substitution1) # label(axiom). [assumption].
% 0.46/1.00 11 -equalish(A,B) | -less_or_equalish(C,A) | less_or_equalish(C,B) # label(less_or_equal_substitution2) # label(axiom). [assumption].
% 0.46/1.00 12 -q2(a,b,A) | -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,a). [resolve(4,b,5,a)].
% 0.46/1.01 13 -less_or_equalish(a,b) | q2(a,b,c). [resolve(1,a,2,a)].
% 0.46/1.01 Derived: -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,a) | -less_or_equalish(a,b). [resolve(12,a,13,b)].
% 0.46/1.01 14 -q2(a,b,A) | -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,b). [resolve(4,b,6,a)].
% 0.46/1.01 Derived: -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,b) | -less_or_equalish(a,b). [resolve(14,a,13,b)].
% 0.46/1.01 15 -q3(a,b,A) | -less_or_equalish(a,a) | -less_or_equalish(b,a) | -less_or_equalish(a,a). [resolve(7,b,5,a)].
% 0.46/1.01 16 less_or_equalish(a,b) | q3(a,b,c). [resolve(3,a,2,a)].
% 0.46/1.01 Derived: -less_or_equalish(a,a) | -less_or_equalish(b,a) | -less_or_equalish(a,a) | less_or_equalish(a,b). [resolve(15,a,16,b)].
% 0.46/1.01
% 0.46/1.01 ============================== end predicate elimination =============
% 0.46/1.01
% 0.46/1.01 Auto_denials: (non-Horn, no changes).
% 0.46/1.01
% 0.46/1.01 Term ordering decisions:
% 0.46/1.01 Function symbol KB weights: a=1. b=1.
% 0.46/1.01
% 0.46/1.01 ============================== end of process initial clauses ========
% 0.46/1.01
% 0.46/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.01
% 0.46/1.01 ============================== end of clauses for search =============
% 0.46/1.01
% 0.46/1.01 ============================== SEARCH ================================
% 0.46/1.01
% 0.46/1.01 % Starting search at 0.01 seconds.
% 0.46/1.01
% 0.46/1.01 ============================== PROOF =================================
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01 % SZS output start Refutation
% 0.46/1.01
% 0.46/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.01 % Length of proof is 18.
% 0.46/1.01 % Level of proof is 5.
% 0.46/1.01 % Maximum clause weight is 6.000.
% 0.46/1.01 % Given clauses 4.
% 0.46/1.01
% 0.46/1.01 1 -q1(A,B,C) | -less_or_equalish(A,B) | q2(A,B,C) # label(clause_1) # label(axiom). [assumption].
% 0.46/1.01 2 q1(a,b,c) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.46/1.01 3 -q1(A,B,C) | less_or_equalish(A,B) | q3(A,B,C) # label(clause_2) # label(axiom). [assumption].
% 0.46/1.01 4 -q2(A,B,C) | q4(A,B,B) # label(clause_3) # label(axiom). [assumption].
% 0.46/1.01 5 -q4(a,b,A) | -less_or_equalish(a,A) | -less_or_equalish(b,A) | -less_or_equalish(A,a) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.46/1.01 6 -q4(a,b,A) | -less_or_equalish(a,A) | -less_or_equalish(b,A) | -less_or_equalish(A,b) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.46/1.01 7 -q3(A,B,C) | q4(A,B,A) # label(clause_4) # label(axiom). [assumption].
% 0.46/1.01 13 -less_or_equalish(a,b) | q2(a,b,c). [resolve(1,a,2,a)].
% 0.46/1.01 14 -q2(a,b,A) | -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,b). [resolve(4,b,6,a)].
% 0.46/1.01 15 -q3(a,b,A) | -less_or_equalish(a,a) | -less_or_equalish(b,a) | -less_or_equalish(a,a). [resolve(7,b,5,a)].
% 0.46/1.01 16 less_or_equalish(a,b) | q3(a,b,c). [resolve(3,a,2,a)].
% 0.46/1.01 17 less_or_equalish(A,A) # label(less_or_equal_reflexivity) # label(axiom). [assumption].
% 0.46/1.01 18 less_or_equalish(A,B) | less_or_equalish(B,A) # label(all_less_or_equal) # label(axiom). [assumption].
% 0.46/1.01 22 -less_or_equalish(a,b) | -less_or_equalish(b,b) | -less_or_equalish(b,b) | -less_or_equalish(a,b). [resolve(14,a,13,b)].
% 0.46/1.01 23 -less_or_equalish(a,b). [copy(22),merge(c),merge(d),unit_del(b,17)].
% 0.46/1.01 24 -less_or_equalish(a,a) | -less_or_equalish(b,a) | -less_or_equalish(a,a) | less_or_equalish(a,b). [resolve(15,a,16,b)].
% 0.46/1.01 25 -less_or_equalish(b,a). [copy(24),merge(c),unit_del(a,17),unit_del(c,23)].
% 0.46/1.01 27 $F. [resolve(23,a,18,b),unit_del(a,25)].
% 0.46/1.01
% 0.46/1.01 % SZS output end Refutation
% 0.46/1.01 ============================== end of proof ==========================
% 0.46/1.01
% 0.46/1.01 ============================== STATISTICS ============================
% 0.46/1.01
% 0.46/1.01 Given=4. Generated=16. Kept=7. proofs=1.
% 0.46/1.01 Usable=4. Sos=2. Demods=0. Limbo=0, Disabled=23. Hints=0.
% 0.46/1.01 Megabytes=0.03.
% 0.46/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of statistics =====================
% 0.46/1.01
% 0.46/1.01 ============================== end of search =========================
% 0.46/1.01
% 0.46/1.01 THEOREM PROVED
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01
% 0.46/1.01 Exiting with 1 proof.
% 0.46/1.01
% 0.46/1.01 Process 5719 exit (max_proofs) Tue Jun 14 23:26:55 2022
% 0.46/1.01 Prover9 interrupted
%------------------------------------------------------------------------------