TSTP Solution File: SYN312-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN312-1 : TPTP v8.1.0. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:18:00 EDT 2022
% Result : Unsatisfiable 0.81s 1.12s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN312-1 : TPTP v8.1.0. Bugfixed v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.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.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 13:05:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.81/1.12 ============================== Prover9 ===============================
% 0.81/1.12 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.12 Process 5702 was started by sandbox2 on n021.cluster.edu,
% 0.81/1.12 Mon Jul 11 13:05:24 2022
% 0.81/1.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5548_n021.cluster.edu".
% 0.81/1.12 ============================== end of head ===========================
% 0.81/1.12
% 0.81/1.12 ============================== INPUT =================================
% 0.81/1.12
% 0.81/1.12 % Reading from file /tmp/Prover9_5548_n021.cluster.edu
% 0.81/1.12
% 0.81/1.12 set(prolog_style_variables).
% 0.81/1.12 set(auto2).
% 0.81/1.12 % set(auto2) -> set(auto).
% 0.81/1.12 % set(auto) -> set(auto_inference).
% 0.81/1.12 % set(auto) -> set(auto_setup).
% 0.81/1.12 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.12 % set(auto) -> set(auto_limits).
% 0.81/1.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.12 % set(auto) -> set(auto_denials).
% 0.81/1.12 % set(auto) -> set(auto_process).
% 0.81/1.12 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.12 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.12 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.12 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.12 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.12 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.12 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.12 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.12 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.12 % set(auto2) -> assign(stats, some).
% 0.81/1.12 % set(auto2) -> clear(echo_input).
% 0.81/1.12 % set(auto2) -> set(quiet).
% 0.81/1.12 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.12 % set(auto2) -> clear(print_given).
% 0.81/1.12 assign(lrs_ticks,-1).
% 0.81/1.12 assign(sos_limit,10000).
% 0.81/1.12 assign(order,kbo).
% 0.81/1.12 set(lex_order_vars).
% 0.81/1.12 clear(print_given).
% 0.81/1.12
% 0.81/1.12 % formulas(sos). % not echoed (8 formulas)
% 0.81/1.12
% 0.81/1.12 ============================== end of input ==========================
% 0.81/1.12
% 0.81/1.12 % From the command line: assign(max_seconds, 300).
% 0.81/1.12
% 0.81/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.12
% 0.81/1.12 % Formulas that are not ordinary clauses:
% 0.81/1.12
% 0.81/1.12 ============================== end of process non-clausal formulas ===
% 0.81/1.12
% 0.81/1.12 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.12
% 0.81/1.12 ============================== PREDICATE ELIMINATION =================
% 0.81/1.12
% 0.81/1.12 ============================== end predicate elimination =============
% 0.81/1.12
% 0.81/1.12 Auto_denials:
% 0.81/1.12 % copying label clause8 to answer in negative clause
% 0.81/1.12
% 0.81/1.12 Term ordering decisions:
% 0.81/1.12 Function symbol KB weights: b=1. c=1. a=1. d=1. f=1. g=1.
% 0.81/1.12
% 0.81/1.12 ============================== end of process initial clauses ========
% 0.81/1.12
% 0.81/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.12
% 0.81/1.12 ============================== end of clauses for search =============
% 0.81/1.12
% 0.81/1.12 ============================== SEARCH ================================
% 0.81/1.12
% 0.81/1.12 % Starting search at 0.01 seconds.
% 0.81/1.12
% 0.81/1.12 ============================== PROOF =================================
% 0.81/1.12 % SZS status Unsatisfiable
% 0.81/1.12 % SZS output start Refutation
% 0.81/1.12
% 0.81/1.12 % Proof 1 at 0.01 (+ 0.00) seconds: clause8.
% 0.81/1.12 % Length of proof is 22.
% 0.81/1.12 % Level of proof is 11.
% 0.81/1.12 % Maximum clause weight is 12.000.
% 0.81/1.12 % Given clauses 38.
% 0.81/1.12
% 0.81/1.12 1 p(a,f(b),c) # label(clause6) # label(negated_conjecture). [assumption].
% 0.81/1.12 2 p(f(b),d,c) # label(clause7) # label(negated_conjecture). [assumption].
% 0.81/1.12 3 -p(f(g(a)),f(g(d)),f(g(c))) # label(clause8) # label(negated_conjecture) # answer(clause8). [assumption].
% 0.81/1.12 4 p(A,B,C) | -p(C,B,A) # label(clause2) # label(negated_conjecture). [assumption].
% 0.81/1.12 5 p(A,B,C) | -p(B,A,C) # label(clause3) # label(negated_conjecture). [assumption].
% 0.81/1.12 6 p(A,B,f(C)) | -p(A,B,C) # label(clause4) # label(negated_conjecture). [assumption].
% 0.81/1.12 7 p(g(A),B,C) | -p(A,B,C) # label(clause5) # label(negated_conjecture). [assumption].
% 0.81/1.12 8 p(A,B,C) | -p(A,D,C) | -p(D,B,C) # label(clause1) # label(negated_conjecture). [assumption].
% 0.81/1.12 15 -p(f(g(a)),f(g(d)),g(c)) # answer(clause8). [resolve(6,a,3,a)].
% 0.81/1.12 21 p(a,d,c). [ur(8,b,1,a,c,2,a)].
% 0.81/1.12 27 -p(g(c),f(g(d)),f(g(a))) # answer(clause8). [resolve(15,a,4,a)].
% 0.81/1.12 34 -p(c,f(g(d)),f(g(a))) # answer(clause8). [resolve(27,a,7,a)].
% 0.81/1.12 39 p(d,a,c). [ur(5,b,21,a)].
% 0.81/1.12 43 p(g(d),a,c). [ur(7,b,39,a)].
% 0.81/1.12 56 -p(c,f(g(d)),g(a)) # answer(clause8). [resolve(34,a,6,a)].
% 0.81/1.12 61 -p(g(a),f(g(d)),c) # answer(clause8). [resolve(56,a,4,a)].
% 0.81/1.12 65 -p(a,f(g(d)),c) # answer(clause8). [resolve(61,a,7,a)].
% 0.81/1.12 86 -p(f(g(d)),a,c) # answer(clause8). [resolve(65,a,5,a)].
% 0.81/1.12 91 -p(c,a,f(g(d))) # answer(clause8). [resolve(86,a,4,a)].
% 0.81/1.12 116 -p(c,a,g(d)) # answer(clause8). [resolve(91,a,6,a)].
% 0.81/1.12 120 -p(g(d),a,c) # answer(clause8). [resolve(116,a,4,a)].
% 0.81/1.12 121 $F # answer(clause8). [resolve(120,a,43,a)].
% 0.81/1.12
% 0.81/1.12 % SZS output end Refutation
% 0.81/1.12 ============================== end of proof ==========================
% 0.81/1.12
% 0.81/1.12 ============================== STATISTICS ============================
% 0.81/1.12
% 0.81/1.12 Given=38. Generated=214. Kept=120. proofs=1.
% 0.81/1.12 Usable=38. Sos=79. Demods=0. Limbo=2, Disabled=8. Hints=0.
% 0.81/1.12 Megabytes=0.09.
% 0.81/1.12 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.81/1.12
% 0.81/1.12 ============================== end of statistics =====================
% 0.81/1.12
% 0.81/1.12 ============================== end of search =========================
% 0.81/1.12
% 0.81/1.12 THEOREM PROVED
% 0.81/1.12 % SZS status Unsatisfiable
% 0.81/1.12
% 0.81/1.12 Exiting with 1 proof.
% 0.81/1.12
% 0.81/1.12 Process 5702 exit (max_proofs) Mon Jul 11 13:05:24 2022
% 0.81/1.12 Prover9 interrupted
%------------------------------------------------------------------------------