TSTP Solution File: SYO038-1.003.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO038-1.003.003 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 19:13:50 EDT 2022
% Result : Unsatisfiable 0.70s 1.02s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYO038-1.003.003 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 14:19:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.02 ============================== Prover9 ===============================
% 0.70/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.02 Process 22979 was started by sandbox2 on n024.cluster.edu,
% 0.70/1.02 Sat Jul 9 14:19:14 2022
% 0.70/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22826_n024.cluster.edu".
% 0.70/1.02 ============================== end of head ===========================
% 0.70/1.02
% 0.70/1.02 ============================== INPUT =================================
% 0.70/1.02
% 0.70/1.02 % Reading from file /tmp/Prover9_22826_n024.cluster.edu
% 0.70/1.02
% 0.70/1.02 set(prolog_style_variables).
% 0.70/1.02 set(auto2).
% 0.70/1.02 % set(auto2) -> set(auto).
% 0.70/1.02 % set(auto) -> set(auto_inference).
% 0.70/1.02 % set(auto) -> set(auto_setup).
% 0.70/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.02 % set(auto) -> set(auto_limits).
% 0.70/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.02 % set(auto) -> set(auto_denials).
% 0.70/1.02 % set(auto) -> set(auto_process).
% 0.70/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.02 % set(auto2) -> assign(stats, some).
% 0.70/1.02 % set(auto2) -> clear(echo_input).
% 0.70/1.02 % set(auto2) -> set(quiet).
% 0.70/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.02 % set(auto2) -> clear(print_given).
% 0.70/1.02 assign(lrs_ticks,-1).
% 0.70/1.02 assign(sos_limit,10000).
% 0.70/1.02 assign(order,kbo).
% 0.70/1.02 set(lex_order_vars).
% 0.70/1.02 clear(print_given).
% 0.70/1.02
% 0.70/1.02 % formulas(sos). % not echoed (6 formulas)
% 0.70/1.02
% 0.70/1.02 ============================== end of input ==========================
% 0.70/1.02
% 0.70/1.02 % From the command line: assign(max_seconds, 300).
% 0.70/1.02
% 0.70/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.02
% 0.70/1.02 % Formulas that are not ordinary clauses:
% 0.70/1.02
% 0.70/1.02 ============================== end of process non-clausal formulas ===
% 0.70/1.02
% 0.70/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.02
% 0.70/1.02 ============================== PREDICATE ELIMINATION =================
% 0.70/1.02
% 0.70/1.02 ============================== end predicate elimination =============
% 0.70/1.02
% 0.70/1.02 Auto_denials:
% 0.70/1.02 % copying label conj to answer in negative clause
% 0.70/1.02
% 0.70/1.02 Term ordering decisions:
% 0.70/1.02
% 0.70/1.02 % Assigning unary symbol s kb_weight 0 and highest precedence (5).
% 0.70/1.02 Function symbol KB weights: one=1. f=1. s=0.
% 0.70/1.02
% 0.70/1.02 ============================== end of process initial clauses ========
% 0.70/1.02
% 0.70/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.02
% 0.70/1.02 ============================== end of clauses for search =============
% 0.70/1.02
% 0.70/1.02 ============================== SEARCH ================================
% 0.70/1.02
% 0.70/1.02 % Starting search at 0.01 seconds.
% 0.70/1.02
% 0.70/1.02 ============================== PROOF =================================
% 0.70/1.02 % SZS status Unsatisfiable
% 0.70/1.02 % SZS output start Refutation
% 0.70/1.02
% 0.70/1.02 % Proof 1 at 0.06 (+ 0.00) seconds: conj.
% 0.70/1.02 % Length of proof is 40.
% 0.70/1.02 % Level of proof is 16.
% 0.70/1.02 % Maximum clause weight is 27.000.
% 0.70/1.02 % Given clauses 76.
% 0.70/1.02
% 0.70/1.02 1 d(one) # label(ax4) # label(axiom). [assumption].
% 0.70/1.02 2 f(A,one) = s(one) # label(ax1) # label(axiom). [assumption].
% 0.70/1.02 3 f(one,s(A)) = s(s(f(one,A))) # label(ax2) # label(axiom). [assumption].
% 0.70/1.02 4 s(s(f(one,A))) = f(one,s(A)). [copy(3),flip(a)].
% 0.70/1.02 5 f(s(A),s(B)) = f(A,f(s(A),B)) # label(ax3) # label(axiom). [assumption].
% 0.70/1.02 6 f(A,f(s(A),B)) = f(s(A),s(B)). [copy(5),flip(a)].
% 0.70/1.02 7 -d(f(s(s(one)),s(s(one)))) # label(conj) # label(negated_conjecture) # answer(conj). [assumption].
% 0.70/1.02 8 -d(A) | d(s(A)) # label(ax5) # label(axiom). [assumption].
% 0.70/1.02 9 f(one,s(one)) = s(s(s(one))). [para(2(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 10 f(s(A),s(one)) = f(A,s(one)). [para(2(a,1),6(a,1,2)),flip(a)].
% 0.70/1.02 11 f(one,s(f(s(one),A))) = s(s(f(s(one),s(A)))). [para(6(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 14 d(s(one)). [hyper(8,a,1,a)].
% 0.70/1.02 15 f(one,s(s(one))) = s(s(s(s(s(one))))). [para(9(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 16 d(s(s(one))). [hyper(8,a,14,a)].
% 0.70/1.02 17 d(s(s(s(one)))). [hyper(8,a,16,a)].
% 0.70/1.02 18 d(s(s(s(s(one))))). [hyper(8,a,17,a)].
% 0.70/1.02 19 d(s(s(s(s(s(one)))))). [hyper(8,a,18,a)].
% 0.70/1.02 21 f(A,f(A,s(one))) = f(s(A),s(s(one))). [para(10(a,1),6(a,1,2))].
% 0.70/1.02 22 d(s(s(s(s(s(s(one))))))). [hyper(8,a,19,a)].
% 0.70/1.02 23 d(s(s(s(s(s(s(s(one)))))))). [hyper(8,a,22,a)].
% 0.70/1.02 24 d(s(s(s(s(s(s(s(s(one))))))))). [hyper(8,a,23,a)].
% 0.70/1.02 25 d(s(s(s(s(s(s(s(s(s(one)))))))))). [hyper(8,a,24,a)].
% 0.70/1.02 26 f(one,s(s(f(s(one),A)))) = s(s(s(s(f(s(one),s(A)))))). [para(11(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 28 d(s(s(s(s(s(s(s(s(s(s(one))))))))))). [hyper(8,a,25,a)].
% 0.70/1.02 29 f(one,s(s(s(one)))) = s(s(s(s(s(s(s(one))))))). [para(15(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 30 d(s(s(s(s(s(s(s(s(s(s(s(one)))))))))))). [hyper(8,a,28,a)].
% 0.70/1.02 33 f(s(one),s(s(one))) = s(s(s(s(s(s(s(one))))))). [para(9(a,1),21(a,1,2)),rewrite([29(6)]),flip(a)].
% 0.70/1.02 34 f(s(A),f(A,s(one))) = f(s(s(A)),s(s(one))). [para(10(a,1),21(a,1,2))].
% 0.70/1.02 40 d(s(s(s(s(s(s(s(s(s(s(s(s(one))))))))))))). [hyper(8,a,30,a)].
% 0.70/1.02 43 d(s(s(s(s(s(s(s(s(s(s(s(s(s(one)))))))))))))). [hyper(8,a,40,a)].
% 0.70/1.02 48 f(s(one),s(s(s(one)))) = f(one,s(s(s(s(s(s(s(one)))))))). [para(33(a,1),6(a,1,2)),flip(a)].
% 0.70/1.02 49 f(s(s(one)),s(s(one))) = f(one,s(s(s(s(s(s(s(one)))))))). [para(9(a,1),34(a,1,2)),rewrite([48(7)]),flip(a)].
% 0.70/1.02 53 -d(f(one,s(s(s(s(s(s(s(one))))))))) # answer(conj). [back_rewrite(7),rewrite([49(7)])].
% 0.70/1.02 54 d(s(s(s(s(s(s(s(s(s(s(s(s(s(s(one))))))))))))))). [hyper(8,a,43,a)].
% 0.70/1.02 55 d(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(one)))))))))))))))). [hyper(8,a,54,a)].
% 0.70/1.02 56 f(one,s(s(s(f(s(one),A))))) = s(s(s(s(s(s(f(s(one),s(A)))))))). [para(26(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 100 f(one,s(s(s(s(f(s(one),A)))))) = s(s(s(s(s(s(s(s(f(s(one),s(A)))))))))). [para(56(a,1),4(a,1,1,1)),flip(a)].
% 0.70/1.02 169 f(one,s(s(s(s(s(s(s(one)))))))) = s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(one))))))))))))))). [para(10(a,1),100(a,1,2,1,1,1,1)),rewrite([9(5),33(16)])].
% 0.70/1.02 186 -d(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(one)))))))))))))))) # answer(conj). [back_rewrite(53),rewrite([169(10)])].
% 0.70/1.02 187 $F # answer(conj). [resolve(186,a,55,a)].
% 0.70/1.02
% 0.70/1.02 % SZS output end Refutation
% 0.70/1.02 ============================== end of proof ==========================
% 0.70/1.02
% 0.70/1.02 ============================== STATISTICS ============================
% 0.70/1.02
% 0.70/1.02 Given=76. Generated=1044. Kept=184. proofs=1.
% 0.70/1.02 Usable=72. Sos=77. Demods=142. Limbo=17, Disabled=23. Hints=0.
% 0.70/1.02 Megabytes=0.37.
% 0.70/1.02 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.70/1.02
% 0.70/1.02 ============================== end of statistics =====================
% 0.70/1.02
% 0.70/1.02 ============================== end of search =========================
% 0.70/1.02
% 0.70/1.02 THEOREM PROVED
% 0.70/1.02 % SZS status Unsatisfiable
% 0.70/1.02
% 0.70/1.02 Exiting with 1 proof.
% 0.70/1.02
% 0.70/1.02 Process 22979 exit (max_proofs) Sat Jul 9 14:19:14 2022
% 0.70/1.02 Prover9 interrupted
%------------------------------------------------------------------------------