TSTP Solution File: SYN636-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN636-1 : TPTP v8.1.0. Released v2.5.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:21:34 EDT 2022
% Result : Unsatisfiable 0.70s 1.03s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN636-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 06:00:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.03 ============================== Prover9 ===============================
% 0.70/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.03 Process 28572 was started by sandbox on n010.cluster.edu,
% 0.70/1.03 Tue Jul 12 06:00:15 2022
% 0.70/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28388_n010.cluster.edu".
% 0.70/1.03 ============================== end of head ===========================
% 0.70/1.03
% 0.70/1.03 ============================== INPUT =================================
% 0.70/1.03
% 0.70/1.03 % Reading from file /tmp/Prover9_28388_n010.cluster.edu
% 0.70/1.03
% 0.70/1.03 set(prolog_style_variables).
% 0.70/1.03 set(auto2).
% 0.70/1.03 % set(auto2) -> set(auto).
% 0.70/1.03 % set(auto) -> set(auto_inference).
% 0.70/1.03 % set(auto) -> set(auto_setup).
% 0.70/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.03 % set(auto) -> set(auto_limits).
% 0.70/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.03 % set(auto) -> set(auto_denials).
% 0.70/1.03 % set(auto) -> set(auto_process).
% 0.70/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.03 % set(auto2) -> assign(stats, some).
% 0.70/1.03 % set(auto2) -> clear(echo_input).
% 0.70/1.03 % set(auto2) -> set(quiet).
% 0.70/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.03 % set(auto2) -> clear(print_given).
% 0.70/1.03 assign(lrs_ticks,-1).
% 0.70/1.03 assign(sos_limit,10000).
% 0.70/1.03 assign(order,kbo).
% 0.70/1.03 set(lex_order_vars).
% 0.70/1.03 clear(print_given).
% 0.70/1.03
% 0.70/1.03 % formulas(sos). % not echoed (40 formulas)
% 0.70/1.03
% 0.70/1.03 ============================== end of input ==========================
% 0.70/1.03
% 0.70/1.03 % From the command line: assign(max_seconds, 300).
% 0.70/1.03
% 0.70/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.03
% 0.70/1.03 % Formulas that are not ordinary clauses:
% 0.70/1.03
% 0.70/1.03 ============================== end of process non-clausal formulas ===
% 0.70/1.03
% 0.70/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.03
% 0.70/1.03 ============================== PREDICATE ELIMINATION =================
% 0.70/1.03
% 0.70/1.03 ============================== end predicate elimination =============
% 0.70/1.03
% 0.70/1.03 Auto_denials: (non-Horn, no changes).
% 0.70/1.03
% 0.70/1.03 Term ordering decisions:
% 0.70/1.03 Function symbol KB weights: c24=1. c27=1. c28=1. c30=1. c31=1. c32=1. c23=1. c25=1. c26=1. c29=1. f13=1. f6=1. f7=1. f12=1. f4=1. f8=1. f16=1. f15=1. f11=1. f17=1. f18=1. f19=1. f20=1.
% 0.70/1.03
% 0.70/1.03 ============================== end of process initial clauses ========
% 0.70/1.03
% 0.70/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.03
% 0.70/1.03 ============================== end of clauses for search =============
% 0.70/1.03
% 0.70/1.03 ============================== SEARCH ================================
% 0.70/1.03
% 0.70/1.03 % Starting search at 0.02 seconds.
% 0.70/1.03
% 0.70/1.03 ============================== PROOF =================================
% 0.70/1.03 % SZS status Unsatisfiable
% 0.70/1.03 % SZS output start Refutation
% 0.70/1.03
% 0.70/1.03 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.70/1.03 % Length of proof is 11.
% 0.70/1.03 % Level of proof is 4.
% 0.70/1.03 % Maximum clause weight is 26.000.
% 0.70/1.03 % Given clauses 106.
% 0.70/1.03
% 0.70/1.03 7 p3(f4(f6(A,f7(B,C))),B) # label(p3_8) # label(negated_conjecture). [assumption].
% 0.70/1.03 9 p3(f4(A),f8(c24)) | p22(f20(A,B,C),f15(A)) | p10(f11(A,c27,B),f11(A,c27,C)) # label(p3_34) # label(negated_conjecture). [assumption].
% 0.70/1.03 12 -p3(c23,f8(c24)) # label(not_p3_7) # label(negated_conjecture). [assumption].
% 0.70/1.03 13 -p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)) # label(not_p10_25) # label(negated_conjecture). [assumption].
% 0.70/1.03 22 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_17) # label(negated_conjecture). [assumption].
% 0.70/1.03 31 p21(f12(f13(c28,c29)),f12(f13(c28,A))) | -p22(A,f15(f6(c25,f7(c23,c26)))) # label(p21_27) # label(negated_conjecture). [assumption].
% 0.70/1.03 37 p3(f4(A),f8(c24)) | p10(f11(A,c27,B),f11(A,c27,C)) | -p21(f12(f13(B,C)),f12(f13(B,f20(A,B,C)))) # label(p3_37) # label(negated_conjecture). [assumption].
% 0.70/1.03 58 -p3(f4(f6(A,f7(c23,B))),f8(c24)). [ur(22,a,12,a,b,7,a)].
% 0.70/1.03 99 -p21(f12(f13(c28,c29)),f12(f13(c28,f20(f6(c25,f7(c23,c26)),c28,c29)))). [ur(37,a,58,a,b,13,a)].
% 0.70/1.03 195 -p22(f20(f6(c25,f7(c23,c26)),c28,c29),f15(f6(c25,f7(c23,c26)))). [ur(31,a,99,a)].
% 0.70/1.03 197 $F. [resolve(195,a,9,b),unit_del(a,58),unit_del(b,13)].
% 0.70/1.03
% 0.70/1.03 % SZS output end Refutation
% 0.70/1.03 ============================== end of proof ==========================
% 0.70/1.03
% 0.70/1.03 ============================== STATISTICS ============================
% 0.70/1.03
% 0.70/1.03 Given=106. Generated=471. Kept=196. proofs=1.
% 0.70/1.03 Usable=106. Sos=89. Demods=0. Limbo=0, Disabled=41. Hints=0.
% 0.70/1.03 Megabytes=0.33.
% 0.70/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.70/1.03
% 0.70/1.03 ============================== end of statistics =====================
% 0.70/1.03
% 0.70/1.03 ============================== end of search =========================
% 0.70/1.03
% 0.70/1.03 THEOREM PROVED
% 0.70/1.03 % SZS status Unsatisfiable
% 0.70/1.03
% 0.70/1.03 Exiting with 1 proof.
% 0.70/1.03
% 0.70/1.03 Process 28572 exit (max_proofs) Tue Jul 12 06:00:15 2022
% 0.70/1.03 Prover9 interrupted
%------------------------------------------------------------------------------