TSTP Solution File: SYN066-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN066-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:13:23 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 6 unt; 3 nHn; 5 RR)
% Number of literals : 20 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,axiom,
( big_r(X3,X3)
| ~ big_q(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.G6PVV3UJIc/E---3.1_2051.p',clause_5) ).
cnf(clause_4,axiom,
( big_p(X1,X2)
| big_q(i(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.G6PVV3UJIc/E---3.1_2051.p',clause_4) ).
cnf(clause_6,negated_conjecture,
~ big_r(a,X1),
file('/export/starexec/sandbox2/tmp/tmp.G6PVV3UJIc/E---3.1_2051.p',clause_6) ).
cnf(clause_3,axiom,
( big_q(h(X1,X2),g(X1))
| ~ big_p(f(X1,X2),g(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.G6PVV3UJIc/E---3.1_2051.p',clause_3) ).
cnf(c_0_4,axiom,
( big_r(X3,X3)
| ~ big_q(X1,X2) ),
clause_5 ).
cnf(c_0_5,axiom,
( big_p(X1,X2)
| big_q(i(X1,X2),X1) ),
clause_4 ).
cnf(c_0_6,negated_conjecture,
~ big_r(a,X1),
clause_6 ).
cnf(c_0_7,plain,
( big_r(X1,X1)
| big_p(X2,X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,axiom,
( big_q(h(X1,X2),g(X1))
| ~ big_p(f(X1,X2),g(X1)) ),
clause_3 ).
cnf(c_0_9,negated_conjecture,
big_p(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
big_q(h(X1,X2),g(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_11,plain,
big_r(X1,X1),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_6,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SYN066-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n013.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 18:25:29 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.G6PVV3UJIc/E---3.1_2051.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # sh5l with pid 2200 completed with status 0
% 0.21/0.53 # Result found by sh5l
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FGUNF-FFSF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 2204 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FGUNF-FFSF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 6
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 6
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 6
% 0.21/0.53 # Processed clauses : 16
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 16
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 1
% 0.21/0.53 # Backward-rewritten : 5
% 0.21/0.53 # Generated clauses : 5
% 0.21/0.53 # ...of the previous two non-redundant : 5
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 5
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 6
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 4
% 0.21/0.53 # Positive orientable unit clauses : 3
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 0
% 0.21/0.53 # Current number of unprocessed clauses: 0
% 0.21/0.53 # ...number of literals in the above : 0
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 12
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 1
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 7
% 0.21/0.53 # BW rewrite match successes : 6
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 202
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.000 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.003 s
% 0.21/0.53 # Maximum resident set size: 1640 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.001 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.006 s
% 0.21/0.53 # Maximum resident set size: 1672 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------