TSTP Solution File: SET787-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET787-1 : TPTP v8.1.0. Released v2.7.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 : n005.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 01:02:38 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n005.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 : Sun Jul 10 02:34:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.39 # The folding up rule is enabled...
% 0.19/0.39 # Local unification is enabled...
% 0.19/0.39 # Any saturation attempts will use folding labels...
% 0.19/0.39 # 14 beginning clauses after preprocessing and clausification
% 0.19/0.39 # Creating start rules for all 2 conjectures.
% 0.19/0.39 # There are 2 start rule candidates:
% 0.19/0.39 # Found 3 unit axioms.
% 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.39 # 2 start rule tableaux created.
% 0.19/0.39 # 11 extension rule candidate clauses
% 0.19/0.39 # 3 unit axiom clauses
% 0.19/0.39
% 0.19/0.39 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 1 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 1 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_27, negated_conjecture, (member(sk2,union(cons(a,cons(b,eptset)))))).
% 0.19/0.39 cnf(i_0_22, plain, (~member(X1,eptset))).
% 0.19/0.39 cnf(i_0_28, negated_conjecture, (~member(sk2,un(a,b)))).
% 0.19/0.39 cnf(i_0_21, plain, (member(X1,un(X2,X3))|~member(X1,X3))).
% 0.19/0.39 cnf(i_0_20, plain, (member(X1,un(X2,X3))|~member(X1,X2))).
% 0.19/0.39 cnf(i_0_17, plain, (subset(X1,X2)|member(subsetI_sk1(X1,X2),X1))).
% 0.19/0.39 cnf(i_0_15, plain, (member(X1,unionE_sk1(X1,X2))|~member(X1,union(X2)))).
% 0.19/0.39 cnf(i_0_18, plain, (subset(X1,X2)|~member(subsetI_sk1(X1,X2),X2))).
% 0.19/0.39 cnf(i_0_19, plain, (X1=X2|member(X1,X3)|~member(X1,cons(X2,X3)))).
% 0.19/0.39 cnf(i_0_16, plain, (member(unionE_sk1(X1,X2),X2)|~member(X1,union(X2)))).
% 0.19/0.39 cnf(i_0_24, plain, (member(pair(X1,X2),X3)|~member(pair(X2,X1),converse(X3)))).
% 0.19/0.39 cnf(i_0_23, plain, (member(pair(X1,X2),converse(X3))|~member(pair(X2,X1),X3))).
% 0.19/0.39 cnf(i_0_26, plain, (member(pair(converse_sk1(X1),converse_sk2(X1)),X2)|~member(X1,converse(X2)))).
% 0.19/0.39 cnf(i_0_25, plain, (pair(converseE_sk2(X1),converseE_sk1(X1))=X1|~member(X1,converse(X2)))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 4 steps
% 0.19/0.39 cnf(i_0_27, negated_conjecture, (member(sk2,union(cons(a,cons(b,eptset))))), inference(start_rule)).
% 0.19/0.39 cnf(i_0_30, plain, (member(sk2,union(cons(a,cons(b,eptset))))), inference(extension_rule, [i_0_16])).
% 0.19/0.39 cnf(i_0_67, plain, (member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(a,cons(b,eptset)))), inference(extension_rule, [i_0_21])).
% 0.19/0.39 cnf(i_0_77, plain, (member(unionE_sk1(sk2,cons(a,cons(b,eptset))),un(X5,cons(a,cons(b,eptset))))), inference(etableau_closure_rule, [i_0_77, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.39 # We now have 7 tableaux to operate on
% 0.19/0.39 # Found closed tableau during pool population.
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------