%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN933+1 : TPTP v7.5.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n010.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 : Mon Mar 28 18:31:50 EDT 2022
% Result : Theorem 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ! [X] : c
<=> c ),
input ).
fof(f1,negated_conjecture,
~ ( ! [X] : c
<=> c ),
inference(assume_negation,status(cth),[prove_this]) ).
fof(f4,negated_conjecture,
~ ( ! [X] : c
<=> c ),
inference(fof_simplification,status(thm),[f1]) ).
fof(f5,negated_conjecture,
( ( ? [X] : ~ c
| ~ c )
& ( ! [X] : c
| c ) ),
inference(fof_nnf,status(thm),[f4]) ).
fof(f6,negated_conjecture,
( ( ? [VAR0] : ~ c
| ~ c )
& ( ! [VAR1] : c
| c ) ),
inference(variable_rename,status(thm),[f5]) ).
fof(f7,negated_conjecture,
( ( ~ c
| ~ c )
& ( ! [VAR1] : c
| c ) ),
inference(skolemize,status(esa),[f6]) ).
fof(f8,negated_conjecture,
( ( ~ c
| ~ c )
& ( c
| c ) ),
inference(shift_quantors,status(thm),[f7]) ).
fof(f9,negated_conjecture,
( ( ~ c
| ~ c )
& ( c
| c ) ),
inference(distribute,status(thm),[f8]) ).
cnf(cnf0,negated_conjecture,
( ~ c
| ~ c ),
inference(split_conjunct,status(thm),[f9]) ).
cnf(c0,plain,
~ c,
inference(factor,status(thm),[cnf0]) ).
fof(prove_this_001,conjecture,
( ! [X] : c
<=> c ),
input ).
fof(f1_002,negated_conjecture,
~ ( ! [X] : c
<=> c ),
inference(assume_negation,status(cth),[prove_this]) ).
fof(f4_003,negated_conjecture,
~ ( ! [X] : c
<=> c ),
inference(fof_simplification,status(thm),[f1]) ).
fof(f5_004,negated_conjecture,
( ( ? [X] : ~ c
| ~ c )
& ( ! [X] : c
| c ) ),
inference(fof_nnf,status(thm),[f4]) ).
fof(f6_005,negated_conjecture,
( ( ? [VAR0] : ~ c
| ~ c )
& ( ! [VAR1] : c
| c ) ),
inference(variable_rename,status(thm),[f5]) ).
fof(f7_006,negated_conjecture,
( ( ~ c
| ~ c )
& ( ! [VAR1] : c
| c ) ),
inference(skolemize,status(esa),[f6]) ).
fof(f8_007,negated_conjecture,
( ( ~ c
| ~ c )
& ( c
| c ) ),
inference(shift_quantors,status(thm),[f7]) ).
fof(f9_008,negated_conjecture,
( ( ~ c
| ~ c )
& ( c
| c ) ),
inference(distribute,status(thm),[f8]) ).
cnf(cnf1,negated_conjecture,
( c
| c ),
inference(split_conjunct,status(thm),[f9]) ).
cnf(c2,plain,
$false,
inference(resolution,status(thm),[cnf1,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN933+1 : TPTP v7.5.0. Released v3.1.0.
% 0.03/0.12 % Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % RAMPerCPU : 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 : Thu Mar 10 17:41:37 EST 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 # Using default include path : /export/starexec/sandbox/benchmark
% 0.18/0.46 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.18/0.46 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.18/0.49 # hasConjecture: true isFOF: true
% 0.18/0.49 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.18/0.49 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.18/0.51 # -----------------
% 0.18/0.51 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51
% 0.18/0.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51 fof(prove_this,conjecture,((![X]:c)<=>c),input).
% 0.18/0.51 fof(f1,negated_conjecture,(~((![X]:c)<=>c)),inference(assume_negation, status(cth), [prove_this])).
% 0.18/0.51 fof(f4,negated_conjecture,(~((![X]:c)<=>c)),inference(fof_simplification, status(thm), [f1])).
% 0.18/0.51 fof(f5,negated_conjecture,(((?[X]:~c)|~c)&((![X]:c)|c)),inference(fof_nnf, status(thm), [f4])).
% 0.18/0.51 fof(f6,negated_conjecture,(((?[VAR0]:~c)|~c)&((![VAR1]:c)|c)),inference(variable_rename, status(thm), [f5])).
% 0.18/0.51 fof(f7,negated_conjecture,((~c|~c)&((![VAR1]:c)|c)),inference(skolemize, status(esa), [f6])).
% 0.18/0.51 fof(f8,negated_conjecture,((~c|~c)&(c|c)),inference(shift_quantors, status(thm), [f7])).
% 0.18/0.51 fof(f9,negated_conjecture,((~c|~c)&(c|c)),inference(distribute, status(thm), [f8])).
% 0.18/0.51 cnf(cnf0,negated_conjecture,~c|~c,inference(split_conjunct, status(thm), [f9])).
% 0.18/0.51 cnf(c0,plain,~c,inference(factor, status(thm), [cnf0])).
% 0.18/0.51 fof(prove_this,conjecture,((![X]:c)<=>c),input).
% 0.18/0.51 fof(f1,negated_conjecture,(~((![X]:c)<=>c)),inference(assume_negation, status(cth), [prove_this])).
% 0.18/0.51 fof(f4,negated_conjecture,(~((![X]:c)<=>c)),inference(fof_simplification, status(thm), [f1])).
% 0.18/0.51 fof(f5,negated_conjecture,(((?[X]:~c)|~c)&((![X]:c)|c)),inference(fof_nnf, status(thm), [f4])).
% 0.18/0.51 fof(f6,negated_conjecture,(((?[VAR0]:~c)|~c)&((![VAR1]:c)|c)),inference(variable_rename, status(thm), [f5])).
% 0.18/0.51 fof(f7,negated_conjecture,((~c|~c)&((![VAR1]:c)|c)),inference(skolemize, status(esa), [f6])).
% 0.18/0.51 fof(f8,negated_conjecture,((~c|~c)&(c|c)),inference(shift_quantors, status(thm), [f7])).
% 0.18/0.51 fof(f9,negated_conjecture,((~c|~c)&(c|c)),inference(distribute, status(thm), [f8])).
% 0.18/0.51 cnf(cnf1,negated_conjecture,c|c,inference(split_conjunct, status(thm), [f9])).
% 0.18/0.51 cnf(c2,plain,$false,inference(resolution, status(thm), [cnf1, c0])).
% 0.18/0.51 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51 # Indexed : true
% 0.18/0.51 # Eval function name : PickGiven5
% 0.18/0.51 # Initial clauses : 2
% 0.18/0.51 # Processed clauses : 3
% 0.18/0.51 # Factors computed : 2
% 0.18/0.51 # Resolvents computed: 2
% 0.18/0.51 # Tautologies deleted: 0
% 0.18/0.51 # Forward subsumed : 0
% 0.18/0.51 # Backward subsumed : 1
% 0.18/0.51 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51 # SZS Expected : Theorem
% 0.18/0.51 # time : 9ms
% 0.18/0.51
%------------------------------------------------------------------------------