TSTP Solution File: LAT260-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT260-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 18:08:11 EDT 2023
% Result : Unsatisfiable 0.80s 1.00s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 5 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/tmp/tmp.Y3FQKKkspM/E---3.1_19320.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/tmp/tmp.Y3FQKKkspM/E---3.1_19320.p',cls_conjecture_1) ).
cnf(c_0_2,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_Tarski_Odual_Acl_A_58_APartialOrder_0 ).
cnf(c_0_3,negated_conjecture,
~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_conjecture_1 ).
cnf(c_0_4,plain,
$false,
inference(sr,[status(thm)],[c_0_2,c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.33 % Problem : LAT260-1 : TPTP v8.1.2. Released v3.2.0.
% 0.34/0.34 % Command : run_E %s %d THM
% 0.34/0.55 % Computer : n002.cluster.edu
% 0.34/0.55 % Model : x86_64 x86_64
% 0.34/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.34/0.55 % Memory : 8042.1875MB
% 0.34/0.55 % OS : Linux 3.10.0-693.el7.x86_64
% 0.34/0.55 % CPULimit : 2400
% 0.34/0.55 % WCLimit : 300
% 0.34/0.55 % DateTime : Mon Oct 2 11:18:29 EDT 2023
% 0.34/0.55 % CPUTime :
% 0.78/0.94 Running first-order theorem proving
% 0.78/0.95 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Y3FQKKkspM/E---3.1_19320.p
% 0.80/1.00 # Version: 3.1pre001
% 0.80/1.00 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.80/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/1.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.80/1.00 # Starting new_bool_3 with 300s (1) cores
% 0.80/1.00 # Starting new_bool_1 with 300s (1) cores
% 0.80/1.00 # Starting sh5l with 300s (1) cores
% 0.80/1.00 # new_bool_3 with pid 19422 completed with status 0
% 0.80/1.00 # Result found by new_bool_3
% 0.80/1.00 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.80/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/1.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.80/1.00 # Starting new_bool_3 with 300s (1) cores
% 0.80/1.00 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/1.00 # Search class: FGHSM-FFMS32-MFFFFFNN
% 0.80/1.00 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.80/1.00 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.80/1.00 # SAT001_MinMin_p005000_rr_RG with pid 19425 completed with status 0
% 0.80/1.00 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.80/1.00 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.80/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/1.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.80/1.00 # Starting new_bool_3 with 300s (1) cores
% 0.80/1.00 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/1.00 # Search class: FGHSM-FFMS32-MFFFFFNN
% 0.80/1.00 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.80/1.00 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.80/1.00 # Preprocessing time : 0.006 s
% 0.80/1.00 # Presaturation interreduction done
% 0.80/1.00
% 0.80/1.00 # Proof found!
% 0.80/1.00 # SZS status Unsatisfiable
% 0.80/1.00 # SZS output start CNFRefutation
% See solution above
% 0.80/1.00 # Parsed axioms : 2748
% 0.80/1.00 # Removed by relevancy pruning/SinE : 2682
% 0.80/1.00 # Initial clauses : 66
% 0.80/1.00 # Removed in clause preprocessing : 0
% 0.80/1.00 # Initial clauses in saturation : 66
% 0.80/1.00 # Processed clauses : 3
% 0.80/1.00 # ...of these trivial : 0
% 0.80/1.00 # ...subsumed : 0
% 0.80/1.00 # ...remaining for further processing : 2
% 0.80/1.00 # Other redundant clauses eliminated : 0
% 0.80/1.00 # Clauses deleted for lack of memory : 0
% 0.80/1.00 # Backward-subsumed : 0
% 0.80/1.00 # Backward-rewritten : 0
% 0.80/1.00 # Generated clauses : 0
% 0.80/1.00 # ...of the previous two non-redundant : 0
% 0.80/1.00 # ...aggressively subsumed : 0
% 0.80/1.00 # Contextual simplify-reflections : 0
% 0.80/1.00 # Paramodulations : 0
% 0.80/1.00 # Factorizations : 0
% 0.80/1.00 # NegExts : 0
% 0.80/1.00 # Equation resolutions : 0
% 0.80/1.00 # Total rewrite steps : 0
% 0.80/1.00 # Propositional unsat checks : 0
% 0.80/1.00 # Propositional check models : 0
% 0.80/1.00 # Propositional check unsatisfiable : 0
% 0.80/1.00 # Propositional clauses : 0
% 0.80/1.00 # Propositional clauses after purity: 0
% 0.80/1.00 # Propositional unsat core size : 0
% 0.80/1.00 # Propositional preprocessing time : 0.000
% 0.80/1.00 # Propositional encoding time : 0.000
% 0.80/1.00 # Propositional solver time : 0.000
% 0.80/1.00 # Success case prop preproc time : 0.000
% 0.80/1.00 # Success case prop encoding time : 0.000
% 0.80/1.00 # Success case prop solver time : 0.000
% 0.80/1.00 # Current number of processed clauses : 2
% 0.80/1.00 # Positive orientable unit clauses : 1
% 0.80/1.00 # Positive unorientable unit clauses: 0
% 0.80/1.00 # Negative unit clauses : 1
% 0.80/1.00 # Non-unit-clauses : 0
% 0.80/1.00 # Current number of unprocessed clauses: 63
% 0.80/1.00 # ...number of literals in the above : 106
% 0.80/1.00 # Current number of archived formulas : 0
% 0.80/1.00 # Current number of archived clauses : 0
% 0.80/1.00 # Clause-clause subsumption calls (NU) : 0
% 0.80/1.00 # Rec. Clause-clause subsumption calls : 0
% 0.80/1.00 # Non-unit clause-clause subsumptions : 0
% 0.80/1.00 # Unit Clause-clause subsumption calls : 0
% 0.80/1.00 # Rewrite failures with RHS unbound : 0
% 0.80/1.00 # BW rewrite match attempts : 0
% 0.80/1.00 # BW rewrite match successes : 0
% 0.80/1.00 # Condensation attempts : 0
% 0.80/1.00 # Condensation successes : 0
% 0.80/1.00 # Termbank termtop insertions : 23632
% 0.80/1.00
% 0.80/1.00 # -------------------------------------------------
% 0.80/1.00 # User time : 0.007 s
% 0.80/1.00 # System time : 0.009 s
% 0.80/1.00 # Total time : 0.016 s
% 0.80/1.00 # Maximum resident set size: 4132 pages
% 0.80/1.00
% 0.80/1.00 # -------------------------------------------------
% 0.80/1.00 # User time : 0.038 s
% 0.80/1.00 # System time : 0.011 s
% 0.80/1.00 # Total time : 0.049 s
% 0.80/1.00 # Maximum resident set size: 3480 pages
% 0.80/1.00 % E---3.1 exiting
% 0.80/1.00 % E---3.1 exiting
%------------------------------------------------------------------------------