TSTP Solution File: SEU142+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU142+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n027.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 : Tue Jul 19 09:24:07 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU142+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 09:53:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.37 # and selection function SelectCQIPrecWNTNp.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 15 Number of unprocessed: 15
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 15 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 5 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 10 extension rule candidate clauses
% 0.13/0.37 # 5 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 10 tableaux to operate on
% 0.13/0.38 # There were 2 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 2 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 2 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_5, plain, (in(X1,singleton(X1)))).
% 0.13/0.38 cnf(i_0_10, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.13/0.38 cnf(i_0_11, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.13/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.13/0.38 cnf(i_0_17, negated_conjecture, (singleton(esk4_0)!=unordered_pair(esk4_0,esk4_0))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.38 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))).
% 0.13/0.38 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 0.13/0.38 cnf(i_0_12, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.13/0.38 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.13/0.38 cnf(i_0_9, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.13/0.38 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_15, plain, (X1=X2|in(esk3_2(X1,X2),X1)|in(esk3_2(X1,X2),X2))).
% 0.13/0.38 cnf(i_0_16, plain, (X1=X2|~in(esk3_2(X1,X2),X2)|~in(esk3_2(X1,X2),X1))).
% 0.13/0.38 cnf(i_0_7, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 5 steps
% 0.13/0.38 cnf(i_0_17, negated_conjecture, (singleton(esk4_0)!=unordered_pair(esk4_0,esk4_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_26, plain, (singleton(esk4_0)!=unordered_pair(esk4_0,esk4_0)), inference(extension_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_47, plain, (in(esk3_2(singleton(esk4_0),unordered_pair(esk4_0,esk4_0)),singleton(esk4_0))), inference(extension_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_48, plain, (in(esk3_2(singleton(esk4_0),unordered_pair(esk4_0,esk4_0)),unordered_pair(esk4_0,esk4_0))), inference(etableau_closure_rule, [i_0_48, ...])).
% 0.13/0.38 cnf(i_0_57, plain, (~in(singleton(esk4_0),esk3_2(singleton(esk4_0),unordered_pair(esk4_0,esk4_0)))), inference(etableau_closure_rule, [i_0_57, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (7545) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------