TSTP Solution File: SYN940+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %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 11:23:44 EDT 2022
% Result : Theorem 0.48s 1.01s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jul 12 06:21:00 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.48/1.01 ============================== Prover9 ===============================
% 0.48/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.01 Process 3476 was started by sandbox on n010.cluster.edu,
% 0.48/1.01 Tue Jul 12 06:21:00 2022
% 0.48/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3323_n010.cluster.edu".
% 0.48/1.01 ============================== end of head ===========================
% 0.48/1.01
% 0.48/1.01 ============================== INPUT =================================
% 0.48/1.01
% 0.48/1.01 % Reading from file /tmp/Prover9_3323_n010.cluster.edu
% 0.48/1.01
% 0.48/1.01 set(prolog_style_variables).
% 0.48/1.01 set(auto2).
% 0.48/1.01 % set(auto2) -> set(auto).
% 0.48/1.01 % set(auto) -> set(auto_inference).
% 0.48/1.01 % set(auto) -> set(auto_setup).
% 0.48/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.01 % set(auto) -> set(auto_limits).
% 0.48/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.01 % set(auto) -> set(auto_denials).
% 0.48/1.01 % set(auto) -> set(auto_process).
% 0.48/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.01 % set(auto2) -> assign(stats, some).
% 0.48/1.01 % set(auto2) -> clear(echo_input).
% 0.48/1.01 % set(auto2) -> set(quiet).
% 0.48/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.01 % set(auto2) -> clear(print_given).
% 0.48/1.01 assign(lrs_ticks,-1).
% 0.48/1.01 assign(sos_limit,10000).
% 0.48/1.01 assign(order,kbo).
% 0.48/1.01 set(lex_order_vars).
% 0.48/1.01 clear(print_given).
% 0.48/1.01
% 0.48/1.01 % formulas(sos). % not echoed (1 formulas)
% 0.48/1.01
% 0.48/1.01 ============================== end of input ==========================
% 0.48/1.01
% 0.48/1.01 % From the command line: assign(max_seconds, 300).
% 0.48/1.01
% 0.48/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.01
% 0.48/1.01 % Formulas that are not ordinary clauses:
% 0.48/1.01 1 -(all B all C ((all Z q(f(Z))) -> (exists X exists Y ((p(f(Y)) -> p(X) & (r(Y) -> r(B) & r(C))) & q(X))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.01
% 0.48/1.01 ============================== end of process non-clausal formulas ===
% 0.48/1.01
% 0.48/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.01
% 0.48/1.01 ============================== PREDICATE ELIMINATION =================
% 0.48/1.01 2 -p(A) | -r(c1) | -r(c2) | -q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 3 q(f(A)) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 Derived: -p(f(A)) | -r(c1) | -r(c2). [resolve(2,d,3,a)].
% 0.48/1.01 4 p(f(A)) | -q(B) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 Derived: p(f(A)). [resolve(4,b,3,a)].
% 0.48/1.01 5 -p(A) | r(B) | -q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 Derived: -p(f(A)) | r(B). [resolve(5,c,3,a)].
% 0.48/1.01 6 p(f(A)). [resolve(4,b,3,a)].
% 0.48/1.01 7 -p(f(A)) | -r(c1) | -r(c2). [resolve(2,d,3,a)].
% 0.48/1.01 Derived: -r(c1) | -r(c2). [resolve(6,a,7,a)].
% 0.48/1.01 8 -p(f(A)) | r(B). [resolve(5,c,3,a)].
% 0.48/1.01 Derived: r(A). [resolve(8,a,6,a)].
% 0.48/1.01
% 0.48/1.01 ============================== end predicate elimination =============
% 0.48/1.01
% 0.48/1.01 Auto_denials: (no changes).
% 0.48/1.01
% 0.48/1.01 Term ordering decisions:
% 0.48/1.01 Function symbol KB weights: c1=1. c2=1.
% 0.48/1.01
% 0.48/1.01 ============================== PROOF =================================
% 0.48/1.01 % SZS status Theorem
% 0.48/1.01 % SZS output start Refutation
% 0.48/1.01
% 0.48/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.48/1.01 % Length of proof is 11.
% 0.48/1.01 % Level of proof is 4.
% 0.48/1.01 % Maximum clause weight is 4.000.
% 0.48/1.01 % Given clauses 0.
% 0.48/1.01
% 0.48/1.01 1 -(all B all C ((all Z q(f(Z))) -> (exists X exists Y ((p(f(Y)) -> p(X) & (r(Y) -> r(B) & r(C))) & q(X))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.01 2 -p(A) | -r(c1) | -r(c2) | -q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 3 q(f(A)) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 4 p(f(A)) | -q(B) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 5 -p(A) | r(B) | -q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.48/1.01 6 p(f(A)). [resolve(4,b,3,a)].
% 0.48/1.01 7 -p(f(A)) | -r(c1) | -r(c2). [resolve(2,d,3,a)].
% 0.48/1.01 8 -p(f(A)) | r(B). [resolve(5,c,3,a)].
% 0.48/1.01 9 -r(c1) | -r(c2). [resolve(6,a,7,a)].
% 0.48/1.01 10 r(A). [resolve(8,a,6,a)].
% 0.48/1.01 11 $F. [back_unit_del(9),unit_del(a,10),unit_del(b,10)].
% 0.48/1.01
% 0.48/1.01 % SZS output end Refutation
% 0.48/1.01 ============================== end of proof ==========================
% 0.48/1.01
% 0.48/1.01 ============================== STATISTICS ============================
% 0.48/1.01
% 0.48/1.01 Given=0. Generated=3. Kept=2. proofs=1.
% 0.48/1.01 Usable=0. Sos=0. Demods=0. Limbo=1, Disabled=10. Hints=0.
% 0.48/1.01 Megabytes=0.02.
% 0.48/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.48/1.01
% 0.48/1.01 ============================== end of statistics =====================
% 0.48/1.01
% 0.48/1.01 ============================== end of search =========================
% 0.48/1.01
% 0.48/1.01 THEOREM PROVED
% 0.48/1.01 % SZS status Theorem
% 0.48/1.01
% 0.48/1.01 Exiting with 1 proof.
% 0.48/1.01
% 0.48/1.01 Process 3476 exit (max_proofs) Tue Jul 12 06:21:00 2022
% 0.48/1.01 Prover9 interrupted
%------------------------------------------------------------------------------