TSTP Solution File: LCL673+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL673+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 : Sun Jul 17 13:49:02 EDT 2022
% Result : Timeout 300.07s 300.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL673+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 2 22:41:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.03 ============================== Prover9 ===============================
% 0.43/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.03 Process 17223 was started by sandbox on n023.cluster.edu,
% 0.43/1.03 Sat Jul 2 22:41:44 2022
% 0.43/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17070_n023.cluster.edu".
% 0.43/1.03 ============================== end of head ===========================
% 0.43/1.03
% 0.43/1.03 ============================== INPUT =================================
% 0.43/1.03
% 0.43/1.03 % Reading from file /tmp/Prover9_17070_n023.cluster.edu
% 0.43/1.03
% 0.43/1.03 set(prolog_style_variables).
% 0.43/1.03 set(auto2).
% 0.43/1.03 % set(auto2) -> set(auto).
% 0.43/1.03 % set(auto) -> set(auto_inference).
% 0.43/1.03 % set(auto) -> set(auto_setup).
% 0.43/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.03 % set(auto) -> set(auto_limits).
% 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.03 % set(auto) -> set(auto_denials).
% 0.43/1.03 % set(auto) -> set(auto_process).
% 0.43/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.03 % set(auto2) -> assign(stats, some).
% 0.43/1.03 % set(auto2) -> clear(echo_input).
% 0.43/1.03 % set(auto2) -> set(quiet).
% 0.43/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.03 % set(auto2) -> clear(print_given).
% 0.43/1.03 assign(lrs_ticks,-1).
% 0.43/1.03 assign(sos_limit,10000).
% 0.43/1.03 assign(order,kbo).
% 0.43/1.03 set(lex_order_vars).
% 0.43/1.03 clear(print_given).
% 0.43/1.03
% 0.43/1.03 % formulas(sos). % not echoed (3 formulas)
% 0.43/1.03
% 0.43/1.03 ============================== end of input ==========================
% 0.43/1.03
% 0.43/1.03 % From the command line: assign(max_seconds, 300).
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.03
% 0.43/1.03 % Formulas that are not ordinary clauses:
% 0.43/1.03 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 2 (all X all Y all Z (r1(X,Y) & r1(Y,Z) -> r1(X,Z))) # label(transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 3 --(exists X -(-(all Y (-r1(X,Y) | p2(Y))) & -(all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))) & -(all Y (-r1(X,Y) | p1(Y))) | -(all Y (-r1(X,Y) | p2(Y))) & -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))) & -(all Y (-r1(X,Y) | p1(Y))) | -(all Y (-r1(X,Y) | p2(Y))) & -(all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))) & -(all Y (-r1(X,Y) | p1(Y))) | -(all Y (-r1(X,Y) | p2(Y))) & -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y)))))))) & -(all Y (-r1(X,Y) | p1(Y))) | -(all Y (-r1(X,Y) | p2(Y))) & -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p1(Y))))) & (all X (-r1(Y,X) | p1(X)))))) & -(all Y (-r1(X,Y) | p1(Y))) | (all Y (-r1(X,Y) | p2(Y))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))) | (all Y (-r1(X,Y) | p1(Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.03
% 0.43/1.03 ============================== end of process non-clausal formulas ===
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.03
% 0.43/1.03 ============================== PREDICATE ELIMINATION =================
% 0.43/1.03 4 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | -p1(f5(B)) | -r1(c1,C) | p1(C) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 5 -p2(c2) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | -p1(f5(A)) | -r1(c1,B) | p1(B). [resolve(4,b,5,a)].
% 0.43/1.03 6 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | r1(B,f5(B)) | -r1(c1,C) | p1(C) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | r1(A,f5(A)) | -r1(c1,B) | p1(B). [resolve(6,b,5,a)].
% 0.43/1.03 7 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | -p1(f1(B)) | -p1(f2(B)) | -r1(c1,C) | p1(C) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | -p1(f1(A)) | -p1(f2(A)) | -r1(c1,B) | p1(B). [resolve(7,b,5,a)].
% 0.43/1.03 8 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | r1(B,f1(B)) | -p1(f2(B)) | -r1(c1,C) | p1(C) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | r1(A,f1(A)) | -p1(f2(A)) | -r1(c1,B) | p1(B). [resolve(8,b,5,a)].
% 0.43/1.03 9 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | -p1(f1(B)) | r1(B,f2(B)) | -r1(c1,C) | p1(C) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | -p1(f1(A)) | r1(A,f2(A)) | -r1(c1,B) | p1(B). [resolve(9,b,5,a)].
% 0.43/1.03 10 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | r1(B,f1(B)) | r1(B,f2(B)) | -r1(c1,C) | p1(C) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | r1(A,f1(A)) | r1(A,f2(A)) | -r1(c1,B) | p1(B). [resolve(10,b,5,a)].
% 0.43/1.03 11 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | -p1(f1(B)) | -r1(f2(B),C) | p1(C) | -r1(c1,D) | p1(D) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | -p1(f1(A)) | -r1(f2(A),B) | p1(B) | -r1(c1,C) | p1(C). [resolve(11,b,5,a)].
% 0.43/1.03 12 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(D) | -p1(f8(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f8(A)) | -r1(c1,D) | p1(D). [resolve(12,b,5,a)].
% 0.43/1.03 13 -r1(c1,A) | p2(A) | -r1(c1,B) | p1(B) | r1(B,f1(B)) | -r1(f2(B),C) | p1(C) | -r1(c1,D) | p1(D) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | p1(A) | r1(A,f1(A)) | -r1(f2(A),B) | p1(B) | -r1(c1,C) | p1(C). [resolve(13,b,5,a)].
% 0.43/1.03 14 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(D) | r1(B,f8(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(A,f8(A)) | -r1(c1,D) | p1(D). [resolve(14,b,5,a)].
% 0.43/1.03 15 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(f6(B,C,D)) | r1(B,f7(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(f6(A,B,C)) | r1(A,f7(A)) | -r1(c1,D) | p1(D). [resolve(15,b,5,a)].
% 0.43/1.03 16 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(D) | -p1(f3(B,C,D)) | -p1(f4(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f3(A,B,C)) | -p1(f4(A)) | -r1(c1,D) | p1(D). [resolve(16,b,5,a)].
% 0.43/1.03 17 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | r1(D,f6(B,C,D)) | r1(B,f7(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f6(A,B,C)) | r1(A,f7(A)) | -r1(c1,D) | p1(D). [resolve(17,b,5,a)].
% 0.43/1.03 18 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(D) | r1(D,f3(B,C,D)) | -p1(f4(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(C,f3(A,B,C)) | -p1(f4(A)) | -r1(c1,D) | p1(D). [resolve(18,b,5,a)].
% 0.43/1.03 19 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(D) | -p1(f3(B,C,D)) | r1(B,f4(B)) | -r1(c1,E) | p1(E) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f3(A,B,C)) | r1(A,f4(A)) | -r1(c1,D) | p1(D). [resolve(19,b,5,a)].
% 0.43/1.03 20 -r1(c1,A) | p2(A) | -r1(c1,B) | -r1(B,C) | -r1(C,D) | p1(f6(B,C,D)) | -r1(f7(B),E) | -p1(E) | -r1(c1,F) | p1(F) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.43/1.03 Derived: -r1(c1,c2) | -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(f6(A,B,C)) | -r1(f7(A),D) | -p1(D) | -r1(c1,E) | p1(E). [resolve(20,b,5,aCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------