TSTP Solution File: SYN563-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN563-10 : TPTP v8.1.0. Released v7.5.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:21:06 EDT 2022
% Result : Unsatisfiable 1.43s 1.76s
% Output : Refutation 1.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN563-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/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 14:37:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.43/1.76 ============================== Prover9 ===============================
% 1.43/1.76 Prover9 (32) version 2009-11A, November 2009.
% 1.43/1.76 Process 19538 was started by sandbox2 on n025.cluster.edu,
% 1.43/1.76 Mon Jul 11 14:37:33 2022
% 1.43/1.76 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19385_n025.cluster.edu".
% 1.43/1.76 ============================== end of head ===========================
% 1.43/1.76
% 1.43/1.76 ============================== INPUT =================================
% 1.43/1.76
% 1.43/1.76 % Reading from file /tmp/Prover9_19385_n025.cluster.edu
% 1.43/1.76
% 1.43/1.76 set(prolog_style_variables).
% 1.43/1.76 set(auto2).
% 1.43/1.76 % set(auto2) -> set(auto).
% 1.43/1.76 % set(auto) -> set(auto_inference).
% 1.43/1.76 % set(auto) -> set(auto_setup).
% 1.43/1.76 % set(auto_setup) -> set(predicate_elim).
% 1.43/1.76 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.43/1.76 % set(auto) -> set(auto_limits).
% 1.43/1.76 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.43/1.76 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.43/1.76 % set(auto) -> set(auto_denials).
% 1.43/1.76 % set(auto) -> set(auto_process).
% 1.43/1.76 % set(auto2) -> assign(new_constants, 1).
% 1.43/1.76 % set(auto2) -> assign(fold_denial_max, 3).
% 1.43/1.76 % set(auto2) -> assign(max_weight, "200.000").
% 1.43/1.76 % set(auto2) -> assign(max_hours, 1).
% 1.43/1.76 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.43/1.76 % set(auto2) -> assign(max_seconds, 0).
% 1.43/1.76 % set(auto2) -> assign(max_minutes, 5).
% 1.43/1.76 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.43/1.76 % set(auto2) -> set(sort_initial_sos).
% 1.43/1.76 % set(auto2) -> assign(sos_limit, -1).
% 1.43/1.76 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.43/1.76 % set(auto2) -> assign(max_megs, 400).
% 1.43/1.76 % set(auto2) -> assign(stats, some).
% 1.43/1.76 % set(auto2) -> clear(echo_input).
% 1.43/1.76 % set(auto2) -> set(quiet).
% 1.43/1.76 % set(auto2) -> clear(print_initial_clauses).
% 1.43/1.76 % set(auto2) -> clear(print_given).
% 1.43/1.76 assign(lrs_ticks,-1).
% 1.43/1.76 assign(sos_limit,10000).
% 1.43/1.76 assign(order,kbo).
% 1.43/1.76 set(lex_order_vars).
% 1.43/1.76 clear(print_given).
% 1.43/1.76
% 1.43/1.76 % formulas(sos). % not echoed (20 formulas)
% 1.43/1.76
% 1.43/1.76 ============================== end of input ==========================
% 1.43/1.76
% 1.43/1.76 % From the command line: assign(max_seconds, 300).
% 1.43/1.76
% 1.43/1.76 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.43/1.76
% 1.43/1.76 % Formulas that are not ordinary clauses:
% 1.43/1.76
% 1.43/1.76 ============================== end of process non-clausal formulas ===
% 1.43/1.76
% 1.43/1.76 ============================== PROCESS INITIAL CLAUSES ===============
% 1.43/1.76
% 1.43/1.76 ============================== PREDICATE ELIMINATION =================
% 1.43/1.76
% 1.43/1.76 ============================== end predicate elimination =============
% 1.43/1.76
% 1.43/1.76 Auto_denials:
% 1.43/1.76 % copying label goal to answer in negative clause
% 1.43/1.76
% 1.43/1.76 Term ordering decisions:
% 1.43/1.76 Function symbol KB weights: true=1. c7=1. b=1. c8=1. a=1. p6=1. p2=1. p5=1. f4=1. f3=1. ifeq2=1. ifeq=1.
% 1.43/1.76
% 1.43/1.76 ============================== end of process initial clauses ========
% 1.43/1.76
% 1.43/1.76 ============================== CLAUSES FOR SEARCH ====================
% 1.43/1.76
% 1.43/1.76 ============================== end of clauses for search =============
% 1.43/1.76
% 1.43/1.76 ============================== SEARCH ================================
% 1.43/1.76
% 1.43/1.76 % Starting search at 0.01 seconds.
% 1.43/1.76
% 1.43/1.76 Low Water (keep): wt=25.000, iters=3367
% 1.43/1.76
% 1.43/1.76 Low Water (keep): wt=23.000, iters=3335
% 1.43/1.76
% 1.43/1.76 Low Water (keep): wt=22.000, iters=3335
% 1.43/1.76
% 1.43/1.76 Low Water (keep): wt=21.000, iters=3338
% 1.43/1.76
% 1.43/1.76 Low Water (keep): wt=20.000, iters=3339
% 1.43/1.76
% 1.43/1.76 Low Water (keep): wt=19.000, iters=3401
% 1.43/1.76
% 1.43/1.76 ============================== PROOF =================================
% 1.43/1.76 % SZS status Unsatisfiable
% 1.43/1.76 % SZS output start Refutation
% 1.43/1.76
% 1.43/1.76 % Proof 1 at 0.69 (+ 0.01) seconds: goal.
% 1.43/1.76 % Length of proof is 33.
% 1.43/1.76 % Level of proof is 9.
% 1.43/1.76 % Maximum clause weight is 23.000.
% 1.43/1.76 % Given clauses 442.
% 1.43/1.76
% 1.43/1.76 1 p2(A,A) = true # label(p2_1) # label(negated_conjecture). [assumption].
% 1.43/1.76 2 p6(A,A) = true # label(p6_2) # label(negated_conjecture). [assumption].
% 1.43/1.76 3 ifeq2(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 1.43/1.76 4 ifeq(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom). [assumption].
% 1.43/1.76 5 p2(f4(c7),f4(c8)) = true # label(p2_4) # label(negated_conjecture). [assumption].
% 1.43/1.76 6 p5(f3(f3(A)),f3(f4(A))) = true # label(p5_7) # label(negated_conjecture). [assumption].
% 1.43/1.76 9 ifeq2(p6(f4(A),B),true,p5(A,B),true) = true # label(p5_8) # label(negated_conjecture). [assumption].
% 1.43/1.76 10 ifeq2(p6(c7,A),true,p6(c7,f3(A)),true) = true # label(p6_9) # label(negated_conjecture). [assumption].
% 1.43/1.76 11 ifeq2(p5(A,B),true,p6(f4(A),B),true) = true # label(p6_10) # label(negated_conjecture). [assumption].
% 1.43/1.76 12 ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b # label(not_p6_5) # label(negated_conjecture). [assumption].
% 1.43/1.76 13 ifeq2(p2(A,B),true,p2(f3(A),f3(B)),true) = true # label(p2_11) # label(negated_conjecture). [assumption].
% 1.43/1.76 15 ifeq2(p2(A,B),true,ifeq2(p2(A,C),true,p2(C,B),true),true) = true # label(p2_13) # label(negated_conjecture). [assumption].
% 1.43/1.76 16 ifeq2(p6(A,B),true,ifeq2(p6(C,A),true,p6(C,B),true),true) = true # label(p6_14) # label(negated_conjecture). [assumption].
% 1.43/1.76 17 ifeq2(p6(A,B),true,ifeq2(p5(B,C),true,p5(A,C),true),true) = true # label(p5_15) # label(negated_conjecture). [assumption].
% 1.43/1.76 18 ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p6(C,A),true,p6(D,B),true),true),true) = true # label(p6_16) # label(negated_conjecture). [assumption].
% 1.43/1.76 20 a != b # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 1.43/1.76 25 p6(c7,f3(c7)) = true. [para(2(a,1),10(a,1,1)),rewrite([3(8)])].
% 1.43/1.76 26 p6(f4(f3(f3(A))),f3(f4(A))) = true. [para(6(a,1),11(a,1,1)),rewrite([3(10)])].
% 1.43/1.76 27 p2(f3(f4(c7)),f3(f4(c8))) = true. [para(5(a,1),13(a,1,1)),rewrite([3(11)])].
% 1.43/1.76 30 ifeq2(p2(A,B),true,p2(B,A),true) = true. [para(1(a,1),15(a,1,1)),rewrite([3(9)])].
% 1.43/1.76 44 ifeq2(p2(A,B),true,ifeq2(p6(A,C),true,p6(B,C),true),true) = true. [para(1(a,1),18(a,1,1)),rewrite([3(13)])].
% 1.43/1.76 63 p6(c7,f3(f3(c7))) = true. [para(25(a,1),10(a,1,1)),rewrite([3(9)])].
% 1.43/1.76 83 ifeq2(p5(f3(f3(c7)),A),true,p5(c7,A),true) = true. [para(63(a,1),17(a,1,1)),rewrite([3(13)])].
% 1.43/1.76 123 ifeq2(p6(f3(f4(A)),B),true,p6(f4(f3(f3(A))),B),true) = true. [para(26(a,1),16(a,1,3,1)),rewrite([3(12)])].
% 1.43/1.76 192 p2(f3(f4(c8)),f3(f4(c7))) = true. [para(27(a,1),30(a,1,1)),rewrite([3(11)])].
% 1.43/1.76 411 ifeq2(p2(A,B),true,p6(B,A),true) = true. [para(2(a,1),44(a,1,3,1)),rewrite([3(7)])].
% 1.43/1.76 4217 p6(f3(f4(c7)),f3(f4(c8))) = true. [para(192(a,1),411(a,1,1)),rewrite([3(11)])].
% 1.43/1.76 7940 p6(f4(f3(f3(c7))),f3(f4(c8))) = true. [para(4217(a,1),123(a,1,1)),rewrite([3(12)])].
% 1.43/1.76 8249 p5(f3(f3(c7)),f3(f4(c8))) = true. [para(7940(a,1),9(a,1,1)),rewrite([3(11)])].
% 1.43/1.76 8263 p5(c7,f3(f4(c8))) = true. [para(8249(a,1),83(a,1,1)),rewrite([3(9)])].
% 1.43/1.76 8266 p6(f4(c7),f3(f4(c8))) = true. [para(8263(a,1),11(a,1,1)),rewrite([3(10)])].
% 1.43/1.76 8280 a = b. [back_rewrite(12),rewrite([8266(6),4(5)])].
% 1.43/1.76 8281 $F # answer(goal). [resolve(8280,a,20,a)].
% 1.43/1.76
% 1.43/1.76 % SZS output end Refutation
% 1.43/1.76 ============================== end of proof ==========================
% 1.43/1.76
% 1.43/1.76 ============================== STATISTICS ============================
% 1.43/1.76
% 1.43/1.76 Given=442. Generated=14731. Kept=8280. proofs=1.
% 1.43/1.76 Usable=440. Sos=7617. Demods=8070. Limbo=14, Disabled=228. Hints=0.
% 1.43/1.76 Megabytes=8.09.
% 1.43/1.76 User_CPU=0.69, System_CPU=0.01, Wall_clock=1.
% 1.43/1.76
% 1.43/1.76 ============================== end of statistics =====================
% 1.43/1.76
% 1.43/1.76 ============================== end of search =========================
% 1.43/1.76
% 1.43/1.76 THEOREM PROVED
% 1.43/1.76 % SZS status Unsatisfiable
% 1.43/1.76
% 1.43/1.76 Exiting with 1 proof.
% 1.43/1.76
% 1.43/1.76 Process 19538 exit (max_proofs) Mon Jul 11 14:37:34 2022
% 1.43/1.76 Prover9 interrupted
%------------------------------------------------------------------------------