TSTP Solution File: SYN311-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN311-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:17:59 EDT 2022
% Result : Unsatisfiable 0.44s 1.01s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN311-1 : TPTP v8.1.0. Released v1.2.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 15:02:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 12484 was started by sandbox on n025.cluster.edu,
% 0.44/1.01 Mon Jul 11 15:02:18 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12331_n025.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_12331_n025.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (6 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials:
% 0.44/1.01 % copying label clause6 to answer in negative clause
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01 Function symbol KB weights: a=1. b=1. c=1. d=1. f=1. g=1.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 ============================== end of clauses for search =============
% 0.44/1.01
% 0.44/1.01 ============================== SEARCH ================================
% 0.44/1.01
% 0.44/1.01 % Starting search at 0.01 seconds.
% 0.44/1.01
% 0.44/1.01 ============================== PROOF =================================
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01 % SZS output start Refutation
% 0.44/1.01
% 0.44/1.01 % Proof 1 at 0.01 (+ 0.00) seconds: clause6.
% 0.44/1.01 % Length of proof is 24.
% 0.44/1.01 % Level of proof is 15.
% 0.44/1.01 % Maximum clause weight is 13.000.
% 0.44/1.01 % Given clauses 38.
% 0.44/1.01
% 0.44/1.01 1 p(a,b,c,d) # label(clause5) # label(negated_conjecture). [assumption].
% 0.44/1.01 2 -p(f(g(d)),f(g(c)),f(g(b)),f(g(a))) # label(clause6) # label(negated_conjecture) # answer(clause6). [assumption].
% 0.44/1.01 3 p(A,B,C,D) | -p(B,C,D,A) # label(clause1) # label(negated_conjecture). [assumption].
% 0.44/1.01 4 p(A,B,C,D) | -p(D,C,B,A) # label(clause2) # label(negated_conjecture). [assumption].
% 0.44/1.01 5 p(A,B,C,g(D)) | -p(A,B,C,D) # label(clause3) # label(negated_conjecture). [assumption].
% 0.44/1.01 6 p(f(A),B,C,D) | -p(A,B,C,D) # label(clause4) # label(negated_conjecture). [assumption].
% 0.44/1.01 8 p(d,a,b,c). [ur(3,b,1,a)].
% 0.44/1.01 12 -p(g(d),f(g(c)),f(g(b)),f(g(a))) # answer(clause6). [resolve(6,a,2,a)].
% 0.44/1.01 17 -p(f(g(a)),f(g(b)),f(g(c)),g(d)) # answer(clause6). [resolve(12,a,4,a)].
% 0.44/1.01 21 -p(g(a),f(g(b)),f(g(c)),g(d)) # answer(clause6). [resolve(17,a,6,a)].
% 0.44/1.01 24 -p(g(a),f(g(b)),f(g(c)),d) # answer(clause6). [resolve(21,a,5,a)].
% 0.44/1.01 30 p(c,d,a,b). [ur(3,b,8,a)].
% 0.44/1.01 37 p(c,d,a,g(b)). [ur(5,b,30,a)].
% 0.44/1.01 42 -p(d,f(g(c)),f(g(b)),g(a)) # answer(clause6). [resolve(24,a,4,a)].
% 0.44/1.01 44 -p(d,f(g(c)),f(g(b)),a) # answer(clause6). [resolve(42,a,5,a)].
% 0.44/1.01 47 -p(f(g(c)),f(g(b)),a,d) # answer(clause6). [resolve(44,a,3,a)].
% 0.44/1.01 62 -p(g(c),f(g(b)),a,d) # answer(clause6). [resolve(47,a,6,a)].
% 0.44/1.01 65 -p(d,a,f(g(b)),g(c)) # answer(clause6). [resolve(62,a,4,a)].
% 0.44/1.01 67 -p(d,a,f(g(b)),c) # answer(clause6). [resolve(65,a,5,a)].
% 0.44/1.01 69 -p(c,f(g(b)),a,d) # answer(clause6). [resolve(67,a,4,a)].
% 0.44/1.01 86 -p(f(g(b)),a,d,c) # answer(clause6). [resolve(69,a,3,a)].
% 0.44/1.01 89 -p(g(b),a,d,c) # answer(clause6). [resolve(86,a,6,a)].
% 0.44/1.01 92 -p(c,d,a,g(b)) # answer(clause6). [resolve(89,a,4,a)].
% 0.44/1.01 93 $F # answer(clause6). [resolve(92,a,37,a)].
% 0.44/1.01
% 0.44/1.01 % SZS output end Refutation
% 0.44/1.01 ============================== end of proof ==========================
% 0.44/1.01
% 0.44/1.01 ============================== STATISTICS ============================
% 0.44/1.01
% 0.44/1.01 Given=38. Generated=161. Kept=92. proofs=1.
% 0.44/1.01 Usable=38. Sos=53. Demods=0. Limbo=0, Disabled=6. Hints=0.
% 0.44/1.01 Megabytes=0.08.
% 0.44/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of statistics =====================
% 0.44/1.01
% 0.44/1.01 ============================== end of search =========================
% 0.44/1.01
% 0.44/1.01 THEOREM PROVED
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01
% 0.44/1.01 Exiting with 1 proof.
% 0.44/1.01
% 0.44/1.01 Process 12484 exit (max_proofs) Mon Jul 11 15:02:18 2022
% 0.44/1.02 Prover9 interrupted
%------------------------------------------------------------------------------